This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York 1966
Gruska, J., Some Classifications of Context-Free Languages, Information and Control, 14 (1969) 152–179
Gruska, J., On a Classification of Context-Free Languages, Kybernetika 3 (1967) 22–29
Gruska, J., Complexity and Unambiguity of Context-Free Grammars and Languages, Information and Control 18 (1971) 502–519
Gruska, J., Descriptional Complexity of Context-Free Languages, Proc. MFCS'73, High Tatras, 71–83
Hopcroft, J. E., On the Equivalence and Containment Problems for Context-Free Languages, Math. Syst. Theory 3 (1969) 119–124
Knuth, D. E., A Characterization of Parenthesis Languages, Information and Control 11 (1967) 269–289
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Černý, A. (1977). Complexity and minimality of context-free grammars and languages. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_144
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_144
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive