Skip to main content
SpringerLink
Log in

String grammars with disconnecting

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

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

Included in the following conference series:

  • 107 Accesses

Abstract

The complexity of languages generated by context-free grammars with disconnecting is investigated. It is shown that even linear and deterministic context-free languages can generate languages of multisets, the membership problem of which is NP-complete. In contrast to that, this problem is in DSPACE(log n) for regular sets.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Bucher and H. Maurer, Theoretische Grundlagen der Programmier-sprachen — Automaten und Sprachen, BI, Mannheim, Reihe Informatik/41, 1984.

    Google Scholar 

  2. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley Publ., Reading, 1978.

    Google Scholar 

  3. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ., Reading, 1979.

    Google Scholar 

  4. H.-J. Kreowski, A pumping lemma for context-free graph languages, Lecture Notes in Computer Science 73, (1979), 270–283.

    Google Scholar 

  5. K.-J. Lange and E. Welzl, String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Hamburg 1984, submitted for publication.

    Google Scholar 

  6. T.W. Pratt, Pair grammars, graph languages and string-to-graph translations, J. of Comput. System Sci. 5 (1971), 560–595.

    Google Scholar 

  7. G. Rozenberg and E. Welzl, Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Report 84-29, Inst. of Appl. Math. and Comput. Sci., University of Leiden, 1984.

    Google Scholar 

  8. K. Ruohonen, Developmental systems with interaction and fragmentation, Information and Control 28 (1975), 91–112.

    Google Scholar 

  9. K. Ruohonen, JL systems with non-fragmented axioms: the hierarchy, Internat. J. of Comput. Math. 5 (1975), 143–156.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Rothenbaumch. 67/9, D-2000, Hamburg 13, FRG

    Klaus-Jörn Lange

  2. Institutes for Information Processing Technical University of Graz and Austrian Computer Society, Schießstattgasse 4a, A-8010, Graz, Austria

    Emo Welzl

Authors
  1. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emo Welzl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, KJ., Welzl, E. (1985). String grammars with disconnecting. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028809

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation