A hierarchy of context-sensitive languages

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


Turing Machine Input Symbol Finite Intersection Informational Process Input Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Câşlaru, On matrix languages, The 6-th International Symposium over the Informational Processes, Bled, 1970.Google Scholar
  2. [2]
    C. Câşlaru, On intersections of context-free languages, Rev. Roum. Math. Pures et Appl., 18(1974), 755–760.Google Scholar
  3. [3]
    S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, 1966.Google Scholar
  4. [4]
    J. E. Hopcroft, J. D. Ullman, Forma Languages and Their Relations to Automata, Addison-Wesley, 1969.Google Scholar
  5. [5]
    L. Y. Liu, P. Weiner, An infinite hierarchy of intersections of context-free languages, Math. Systems Theory, 7 (1973), 187–192.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Irina Gorun
    • 1
  1. 1.BucharestRomania

Personalised recommendations