Advertisement

Zur Komplexität gesteuerter kontextfreier Ersetzungen

  • A. B. Cremers
  • O. Mayer
  • K. Weiss
Formale Sprachen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2)

Keywords

Phrase Structure Grammar Dann Gilt Eine Matrix Nach Lemma Rigen Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. 1.
    ABRAHAM, S. (1965). Some Questions of Phrase Structure Grammars. Computational Linguistics, 4, 61–70.Google Scholar
  2. 2.
    CREMERS, A.B., O. MAYER, K. WEISS (1973). On the complexity of regulated context-free rewriting. Erscheint in Information and Control.Google Scholar
  3. 3.
    GINSBURG, S. (1966). The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York.Google Scholar
  4. 4.
    GRUSKA, J. (1969). Some Classifications of Context-Free Languages. Information and Control 14, 152–179.Google Scholar
  5. 5.
    ROSENKRANTZ, D. (1969). Programmed Grammars and Classes of Formal Languages. Journal of the ACM 16, 107–131.Google Scholar
  6. 6.
    SALOMAA, A. (1969). On the Index of a Context-Free Grammar and Language. Information and Control 14, 474–477.Google Scholar
  7. 7.
    SALOMAA, A. (1970). Periodically Time-Variant Context-Free Grammars. Information and Control 17, 294–311.Google Scholar

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • A. B. Cremers
  • O. Mayer
  • K. Weiss

There are no affiliations available

Personalised recommendations