Skip to main content
SpringerLink
Log in

The Boolean closure of linear context-free languages

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

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 a certain level, 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci. 8, 315–332 (1974)

    MATH  MathSciNet  Google Scholar 

  2. Bordihn, H., Holzer, M., Kutrib, M.: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16, 423–440 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Buchholz, Th., Kutrib, M.: On time computability of functions in one-way cellular automata. Acta Inf. 35, 329–352 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Choffrut, C., Čulik, K. II.: On real-time cellular automata and trellis automata. Acta Inf. 21, 393–407 (1984)

    MATH  Google Scholar 

  5. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    Google Scholar 

  6. Dyer, C.R.: One-way bounded cellular automata. Inf. Control 44, 261–281 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw Hill, New York (1966)

    MATH  Google Scholar 

  8. Ginsburg, S., Greibach, S.A.: Deterministic context-free languages. Inf. Control 9, 620–648 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  9. Heilbrunner, S., Schmitz, L.: An efficient recognizer for the Boolean closure of context-free languages. Theoret. Comput. Sci. 80, 53–75 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theoret. Comput. Sci. 29, 123–153 (1984)

    Article  MathSciNet  Google Scholar 

  11. Ibarra, O.H., Jiang, T., Wang, H.: Parallel parsing on a one-way linear array of finite-state machines. Theoret. Comput. Sci. 85, 53–74 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ilie, L., Păun, G., Rozenberg, G., Salomaa, A.: On strongly context-free languages. Discrete Appl. Math. 103, 153–165 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Liu, L.Y., Weiner, P.: An infinite hierarchy of intersections of context-free languages. Math. Syst. Theory 7, 185–192 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  14. Okhotin, A.: Automaton representation of linear conjunctive languages. In: Developments in Language Theory (DLT 2002), no. 2450 in LNCS, pp. 393–404. Springer, Heidelberg (2003)

  15. Okhotin, A.: Boolean grammars. Inf. Comput. 194, 19–48 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Parikh, R.J.: On context-free languages. J. ACM 13, 570–581 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  17. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  18. Smith, A.R. III. : Cellular automata and formal languages. In: IEEE Symposium on Switching and Automata Theory, pp. 216–224. IEEE (1970)

  19. Smith, A.R. III. : Real-time language recognition by one-dimensional cellular automata. J. Comput. Syst. Sci. 6, 233–253 (1972)

    MATH  Google Scholar 

  20. Terrier, V.: On real time one-way cellular array. Theoret. Comput. Sci. 141, 331–335 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wotschke, D.: The Boolean closures of the deterministic and non-deterministic context-free languages. In: GI Jahrestagung, no. 1 in LNCS, pp. 113–121. Springer, Heidelberg (1973)

  22. Wotschke, D.: Degree-languages: a new concept of acceptance. J. Comput. Syst. Sci. 14, 187–209 (1977)

    MATH  MathSciNet  Google Scholar 

  23. Wotschke, D.: Nondeterminism and Boolean operations in pda’s. J. Comput. Syst. Sci. 16, 456–461 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Martin Kutrib

  2. Fachbereich Informatik und Mathematik, Johann Wolfgang Goethe-Universität Frankfurt, 60054, Frankfurt am Main, Germany

    Andreas Malcher & Detlef Wotschke

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Malcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Detlef Wotschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Kutrib.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kutrib, M., Malcher, A. & Wotschke, D. The Boolean closure of linear context-free languages. Acta Informatica 45, 177–191 (2008). https://doi.org/10.1007/s00236-007-0068-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-007-0068-6

Keywords

Search

Navigation