Analyzing families of grammars

  • Eberhard Bertsch
Freitagvormittag Hauptvortrag
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)

List of references

  1. 1).
    Bertsch,E.: Surjectivity of functors on grammars, appearing in Mathematical Systems Theory, vol.10, no.1Google Scholar
  2. 2).
    Bertsch,E.: An observation on relative parsing time, appearing in Journal of the ACM, vol.22, no.3Google Scholar
  3. 3).
    Cremers,A. and S.Ginsburg: Context-free grammar forms, in Lecture Notes in Computer Science, vol.14Google Scholar
  4. 4).
    Ginsburg,S. and M.Harrison: Bracketed context-free languages, Journal of Computer and System Sciences (1967)Google Scholar
  5. 5).
    Hotz,G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen, Elektr. Inform. und Kybern. (1966)Google Scholar
  6. 6).
    Hotz,G. and V.Claus: Automatentheorie und formale Sprachen, vol.3, BI-HTB 823a, Duden-Verlag (1973)Google Scholar
  7. 7).
    Schnorr,C.: Transformational Classes of Grammars, Information and Control (1969)Google Scholar
  8. 8).
    Thatcher,J.: Characterizing derivation trees of context-free grammars through a generalization of finite automata-theory, Journal of Computer and System Sciences (1967)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Eberhard Bertsch
    • 1
  1. 1.Universität des SaarlandesGermany

Personalised recommendations