Skip to main content
SpringerLink
Log in

Dyck1-reductions of Context-free Languages

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

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

Included in the following conference series:

Abstract

We consider language families obtained from context-free languages by complete cancellation of substrings from the Dyck language with one pair of parentheses. The class of such languages contains languages with arbitrary exponential growth, the Petri net languages, and NP-complete 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.

4. References

  1. R. Book, M. Jantzen, C. Wrathall: Monadic Thue Systems Theor. Comp. Sci. 19, 231–251 (1982)

    Google Scholar 

  2. V. Geffert: Grammars with Context Dependency Restricted to Synchronization LNCS 233, 370–378 Springer (1986)

    Google Scholar 

  3. T. V. Griffiths: Some Remarks on Derivations in General Rewriting Systems Inf. Contr. 12, 27–54 (1968).

    Google Scholar 

  4. M. Jantzen: Thue Congruences and Complete String Rewriting Systems Habilitation, Hamburg (1986). To be published as EATCS monograph

    Google Scholar 

  5. M. Jantzen, H. Petersen: Petri Net Languages and One-sided Dyck-reductions on Context-free Sets To be Published

    Google Scholar 

  6. W. J. Savitch: Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines Inf. Contr. 27, 37–60 (1975)

    Google Scholar 

  7. W. J. Savitch: Parentheses Grammars and Lindenmayer Systems In: G. Rozenberg, A. Salomaa (editors): The Book of L, 403–411 Springer (1986)

    Google Scholar 

  8. D. Stanat: Formal Languages and Power Sets 3 rd ACM Symp. Theory of Computing, 1–11 (1971)

    Google Scholar 

  9. J. L. Peterson: Petri Net Theory and the Modelling of Systems Prentice Hall (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Schlüterstraße 70, D-2000, Hamburg 13

    Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange & Holger Petersen

Authors
  1. Matthias Jantzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Kudlek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Holger Petersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jantzen, M., Kudlek, M., Lange, KJ., Petersen, H. (1987). Dyck1-reductions of Context-free Languages. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation