Skip to main content

A hierarchy of context-sensitive languages

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 45))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Câşlaru, On matrix languages, The 6-th International Symposium over the Informational Processes, Bled, 1970.

    Google Scholar 

  2. C. Câşlaru, On intersections of context-free languages, Rev. Roum. Math. Pures et Appl., 18(1974), 755–760.

    Google Scholar 

  3. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, 1966.

    Google Scholar 

  4. J. E. Hopcroft, J. D. Ullman, Forma Languages and Their Relations to Automata, Addison-Wesley, 1969.

    Google Scholar 

  5. L. Y. Liu, P. Weiner, An infinite hierarchy of intersections of context-free languages, Math. Systems Theory, 7 (1973), 187–192.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorun, I. (1976). A hierarchy of context-sensitive languages. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_190

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_190

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics