Skip to main content
SpringerLink
Log in
Book cover

GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen pp 149–155Cite as

Zur Komplexität gesteuerter kontextfreier Ersetzungen

  • Formale Sprachen
  • Conference paper
  • First Online:

  • 1635 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. ABRAHAM, S. (1965). Some Questions of Phrase Structure Grammars. Computational Linguistics, 4, 61–70.

    Google Scholar 

  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. GINSBURG, S. (1966). The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York.

    Google Scholar 

  4. GRUSKA, J. (1969). Some Classifications of Context-Free Languages. Information and Control 14, 152–179.

    Google Scholar 

  5. ROSENKRANTZ, D. (1969). Programmed Grammars and Classes of Formal Languages. Journal of the ACM 16, 107–131.

    Google Scholar 

  6. SALOMAA, A. (1969). On the Index of a Context-Free Grammar and Language. Information and Control 14, 474–477.

    Google Scholar 

  7. SALOMAA, A. (1970). Periodically Time-Variant Context-Free Grammars. Information and Control 17, 294–311.

    Google Scholar 

Download references

Authors
  1. A. B. Cremers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Mayer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Weiss
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Cremers, A.B., Mayer, O., Weiss, K. (1973). Zur Komplexität gesteuerter kontextfreier Ersetzungen. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039149

Download citation

  • DOI: https://doi.org/10.1007/BFb0039149

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation