Skip to main content

Parallel Communicating Grammar Systems with Incomplete Information Communication

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

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

Included in the following conference series:

  • 443 Accesses

Abstract

We examine the generative power of parallel communicating (PC) grammar systems with context-free or E0L components communicating incomplete information, that is, only subwords of their sentential forms. We prove that these systems in most cases, even with E0L components, generate all recursively enumerable languages.

Research supported in part by the Hungarian Scientific Research Fund “OTKA” grant no. T 029615.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, Yverdon, 1994.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Dassow, Gh. Păun, G. Rozenberg, Grammar Systems. Handbook of Formal Languages, Volume II, Chapter 4, ed. by G. Rozenberg and A. Salomaa, Springer, Berlin, 1997, 155–213.

    Google Scholar 

  4. V. Geffert, Context-free-like forms for phrase structure grammars. In: Proc. MFCS’88, LNCS 324, Springer-Verlag, Berlin, 1988, 309–317.

    Google Scholar 

  5. Handbook of Formal Languages, ed. by G. Rozenberg and A. Salomaa, Springer, Berlin, 1997.

    MATH  Google Scholar 

  6. N. Mandache, On the computational power of context-free PC grammar systems. Theoretical Computer Science, 237 (2000), 135–148.

    Article  MATH  MathSciNet  Google Scholar 

  7. Gh. Păun, Parallel communicating grammar systems: Recent results, open problems. Acta Cybernetica, 12 (1996), 381–395.

    MathSciNet  MATH  Google Scholar 

  8. Gh. Păun, L. Sântean, Parallel communicating grammar systems: the regular case, Ann. Univ. Bucharest, Ser. Matem.-Inform. 38, 2 (1989), 55–63.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Vaszil, G. (2002). Parallel Communicating Grammar Systems with Incomplete Information Communication. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics