Skip to main content
SpringerLink
Log in

An infinite hierarchy of intersections of context-free languages

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The class of languages expressible as the intersection ofk context-free languages is shown to be properly contained within the class of languages expressible as the intersection ofk + 1 context-free languages. Hence an infinite hierarchy of classes of languages is exhibited between the class of context-sensitive languages and the class of context-free languages.

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.

Similar content being viewed by others

References

  1. Y. Bar-Hillel, M. Perles andE. Shamir, On formal properties of simple phrase structure grammars,Z. Phonetik Sprachwiss. Kommunikat. 14 (1961), 142–172.

    Google Scholar 

  2. N. Chomsky andM. P. Schützenberger, The algebraic theory of context-free languages,Computer Programming and Formal Systems, North Holland, Amsterdam, 1963, pp. 118–161.

    Google Scholar 

  3. J. Evey, “The Theory and Application of Pushdown Store Machines”, Harvard University Doctoral Thesis, 1963.

  4. S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.

    Google Scholar 

  5. S. Ginsburg andE. H. Spanier, Bounded ALGOL-like languages,Trans. Amer. Math. Soc. 113 (1964), 333–368.

    Google Scholar 

  6. S. Ginsburg andE. H. Spanier, Semigroups, Presburger formulas and languages,Pacific J. Math. 16 (1966), 285–296.

    Google Scholar 

  7. S. Y. Kuroda, Classes of languages and linear bounded automata,Information and Control 7 (1964), 207–223.

    Google Scholar 

  8. J. Myhill, “Linear bounded automata”,WADD Tech. Note, No. 60-165 Wright Patterson Air Force Base, Ohio, 1960.

    Google Scholar 

  9. R. J. Parikh, “Language generating devices”, M.I.T. Res. Lab. Electron Quart Prog. Rept. 60, 1961, pp. 199–212.

  10. Leonard Y. Liu, “Finite-Reversal Pushdown Automata,” Ph.D. Dissertation, Princeton University, 1968, pp. 62–63.

Download references

Author information

Authors and Affiliations

  1. International Business Machines Corporation, 10598, Yorktown Heights, New York, USA

    Leonard Y. Liu

  2. Department of Computer Science, Yale University, 06520, New Haven, Connecticut, USA

    Peter Weiner

Authors
  1. Leonard Y. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Weiner
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, L.Y., Weiner, P. An infinite hierarchy of intersections of context-free languages. Math. Systems Theory 7, 185–192 (1973). https://doi.org/10.1007/BF01762237

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762237

Keywords

Search

Navigation