This is a preview of subscription content, log in via an institution.
Literatur
Goldstine, J.: “Automata with Data Storage”, Proc.Conf. on Theoretical Computer Science, University of Waterloo, Ontario, Canada (August 1977) P. 239–246
Goldstine, J.: “A Rational Theory of AFLS”, Lecture Notes in Comp. Science, Vol. 71, Automata, Languages and Programming, Graz 1979 (Editor H.A. Maurer). P. 271–281
Hotz, G.-Estenfeld,K.: “Automatentheorie und Formale Sprachen I”, Bibliographisches Institut Mannheim, erscheint in diesem Jahr.
Hotz, G.: “Der Satz von Chomsky-Schützenberger und die schwerste kontext-freie Sprache von S. Greibach”. Société Mathématique de France. Astérisque 38–39 (1976) P. 105–115.
Shamir, E.: “A Representation Theorem for Algebraic and Contextfree Power Series in Noncommuting Variables”. Information and Control 11, 1967 P. 239–254
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hotz, G. (1981). Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017299
Download citation
DOI: https://doi.org/10.1007/BFb0017299
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive