On the generative capacity of the strict global grammars

  • Sorin Ciobotaru
  • Gheorghe Paun
Donnerstagvormittag Hauptvortrag
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


Generative Capacity Finite Index Context Free Grammar Context Free Language Syntactic Complexity 
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.


  1. 1.
    Brainerd B. An analog of a theorem about context free languages. Information and Control 11 (1968), 561–567.Google Scholar
  2. 2.
    Ginsburg S. The mathematical theory of context free languages. Mc Graw-Hill Book Company New-York (1966).Google Scholar
  3. 3.
    Gruska J. Descriptional complexity of context free languages. Proc. of symp. and summ. school. Math. fund of computer sci. High Tatras (1973).Google Scholar
  4. 4.
    Levitina M.K. On some grammars with global productions. N.T.I. 2 (1972), 32–36 (in russ.)Google Scholar
  5. 5.
    Salomaa A. On the index of a context free grammar and language. Information and Control, 14 (1968), 474–477.Google Scholar
  6. 6.
    Salomaa A. Formal languages. Academic Press New York and London (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Sorin Ciobotaru
    • 1
  • Gheorghe Paun
    • 1
  1. 1.Secţia de studiul sistemelorUniversitatea BucureştiBucureşti, s 8Romania

Personalised recommendations