Skip to main content
SpringerLink
Log in

On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems

  • Chapter
Where Mathematics, Computer Science, Linguistics and Biology Meet

Abstract

We show that there exists a natural number k such that every recursively enumerable language can be generated by a context-free returning parallel communicating grammar system where the number of nonterminals is less than or equal to this constant. Moreover, the component grammars of the system have a limited number of productions. The result demonstrates that context-free returning parallel communicating grammar systems are economical tools for language generation.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Csuhaj-Varjú, E.; J. Dassow; J. Kelemen & Gh. Păun (1994), Grammar Systems: A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London.

    MATH  Google Scholar 

  2. Csuhaj-Varjú, E. & Gy. Vaszil (1999), On the computational completeness of context-free parallel communicating grammar systems, Theoretical Computer Science, 215: 349–358.

    Article  MathSciNet  MATH  Google Scholar 

  3. Csuhaj-Varju, E. & Gy. Vaszil (1999), Parallel communicating grammar systems with bounded resources, submitted.

    Google Scholar 

  4. Dassow, J.; Gh. Păun & G. Rozenberg (1997), Grammar Systems, in G. Rozenberg & A. Salomaa, eds., Handbook of Formal Languages, II: 155–213. Springer, Berlin.

    Google Scholar 

  5. Geifert, V (1988), Context-free-like forms for phrase-structure grammars, in Proceedings of MFCS’88: 309–317. Springer, Berlin.

    Google Scholar 

  6. Păun, Gh. & L. Sântean, L. (1989), Parallel communicating grammar systems: the regular case, Ann. Univ. Bucharest, Sen Mat-Inf, 38.1: 55–63.

    MATH  Google Scholar 

  7. Salomaa, A. (1973), Formal Languages, Academic Press, New York.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

Authors
  1. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  2. University of Bucharest, Bucharest, Romania

    Victor Mitrana

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Csuhaj-Varjú, E. (2001). On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems. In: Martín-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9634-3_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5607-8

  • Online ISBN: 978-94-015-9634-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation