Chapter PDF
Keywords
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.
References
Brainerd B. An analog of a theorem about context free languages. Information and Control 11 (1968), 561–567.
Ginsburg S. The mathematical theory of context free languages. Mc Graw-Hill Book Company New-York (1966).
Gruska J. Descriptional complexity of context free languages. Proc. of symp. and summ. school. Math. fund of computer sci. High Tatras (1973).
Levitina M.K. On some grammars with global productions. N.T.I. 2 (1972), 32–36 (in russ.)
Salomaa A. On the index of a context free grammar and language. Information and Control, 14 (1968), 474–477.
Salomaa A. Formal languages. Academic Press New York and London (1973).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciobotaru, S., Paun, G. (1975). On the generative capacity of the strict global grammars. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive