Advertisement

Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen

  • Günter Hotz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 104)

Literatur

  1. [G1]
    Goldstine, J.: “Automata with Data Storage”, Proc.Conf. on Theoretical Computer Science, University of Waterloo, Ontario, Canada (August 1977) P. 239–246Google Scholar
  2. [G2]
    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–281Google Scholar
  3. [Ho.-E.]
    Hotz, G.-Estenfeld,K.: “Automatentheorie und Formale Sprachen I”, Bibliographisches Institut Mannheim, erscheint in diesem Jahr.Google Scholar
  4. [Ho.]
    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.Google Scholar
  5. [Sh]
    Shamir, E.: “A Representation Theorem for Algebraic and Contextfree Power Series in Noncommuting Variables”. Information and Control 11, 1967 P. 239–254CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Günter Hotz
    • 1
  1. 1.Universität des SaarlandesGermany

Personalised recommendations