Abstract
The connections are established between full and bounded grammatical complexity measures of context-free languages for the case of Greibach normal form grammars and some known complexity measures.
Preview
Unable to display preview. Download preview PDF.
References
Greibach, S.A., A new normal form theorem for context-free phrase structure grammars. J.Assoc.Comp.Mach. 12(1965), 42–52.
Gruska, J., Some classifications of context-free languages. Inf. and Control 14 (1969), 152–179.
Gruska, J., On the size of context-free grammars. Kybernetika 8 (1972) 213–218.
Gruska, J., Descriptional complexity of context-free languages. Proceedings of MFCS 73 (1973), 71–83.
Hopcroft, J., Ullman, J., Formal languages and their relation to automata. Addision-Wesley Publishing Co. 1969.
Pirická, A., Complexity and Normal forms of CFL. Lecture Notes in Comp. Sci. 28 (1975), 292–297.
Pirická-Kelemenová, A., Bounded grammatical complexity of CFL. (submitted for publication).
Rosenkrantz, D., Matrix equations and normal forms for context-free grammars. J.Assoc.Comput.Mach.14, (1967), 501–507.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pirická-Kelemenová, A. (1975). Greibach normal form complexity. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_219
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_219
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive