Chapter PDF
List of references
Bertsch,E.: Surjectivity of functors on grammars, appearing in Mathematical Systems Theory, vol.10, no.1
Bertsch,E.: An observation on relative parsing time, appearing in Journal of the ACM, vol.22, no.3
Cremers,A. and S.Ginsburg: Context-free grammar forms, in Lecture Notes in Computer Science, vol.14
Ginsburg,S. and M.Harrison: Bracketed context-free languages, Journal of Computer and System Sciences (1967)
Hotz,G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen, Elektr. Inform. und Kybern. (1966)
Hotz,G. and V.Claus: Automatentheorie und formale Sprachen, vol.3, BI-HTB 823a, Duden-Verlag (1973)
Schnorr,C.: Transformational Classes of Grammars, Information and Control (1969)
Thatcher,J.: Characterizing derivation trees of context-free grammars through a generalization of finite automata-theory, Journal of Computer and System Sciences (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertsch, E. (1975). Analyzing families of 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_31
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_31
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