The Boolean Closure of Linear Context-Free Languages

  • Martin Kutrib
  • Andreas Malcher
  • Detlef Wotschke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3340)

Abstract

Closures of linear context-free languages under Boolean operations are investigated. The intersection closure and the complementation closure are incomparable. By closing these closures under further Boolean operations we obtain several new language families. The hierarchy obtained by such closures of closures is proper up to level four, where it collapses to the Boolean closure which, in turn, is incomparable with several closures of the family of context-free languages. The Boolean closure of the linear context-free languages is properly contained in the Boolean closure of the context-free languages. A characterization of a class of non-unary languages that cannot be expressed as a Boolean formula over the linear context-free languages is presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Martin Kutrib
    • 1
  • Andreas Malcher
    • 2
  • Detlef Wotschke
    • 2
  1. 1.Institut für InformatikUniversität GiessenGiessenGermany
  2. 2.Institut für InformatikJohann Wolfgang Goethe-Universität FrankfurtFrankfurt am MainGermany

Personalised recommendations