Advertisement

Strukturelle Untersuchungen zur schwersten kontextfreien Sprache

  • K. Estenfeld
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

Abstract

In this paper the grammatical structure of the "Hardest contextfree language" L0 of Sh. Greibach 4 is analyzed and the following result is obtained : There exists a grammar G0 for L0, such that for each c.f. language L and for each c.f. grammar G in Greibach-Normalform generating L the set of derivations of words of L in G is mapped functorially into the set of derivations of the words of L0 in G0.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  1. [1]
    Aho,Ullman The Theory of Parsing,Translation and Compiling Vol. I Parsing,Prentice-HallGoogle Scholar
  2. [2]
    Estenfeld Ein funktorieller Zusammenhang zwischen einer beliebigen kontextfreien Sprache und der Greibachsprache Diplomarbeit, Saarbrücken 1976Google Scholar
  3. [3]
    Greibach A new Normalform Theorem for Contextfree Phrase Structure Grammars JACM 12,1965Google Scholar
  4. [4]
    Greibach Remarks on Context-Free Languages and Polynomial Time Recognition Dep. ofSystem Science University of California, Los AngelesGoogle Scholar
  5. [5]
    Hopcroft-Ullman Formal Languages and their Relation to Automata Addison Wesley 1969Google Scholar
  6. [6]
    Hotz,Claus Automatentheorie und formale Sprachen Band III Formale Sprachen, BI-HochschulskriptenGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • K. Estenfeld

There are no affiliations available

Personalised recommendations