Skip to main content
SpringerLink
Log in

Eliminating Communication by Parallel Rewriting

  • 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:

  • 440 Accesses

Abstract

We shall show that simple communication can be substituted by parallel rewriting and nondeterminism without a time penalty. This is no longer true for more complex communication. In particular, we shall show that time preserving simulation of regular PCGS by g-systems is possible whereas time preserving simulation of context-free PCGS is impossible.

This research was supported in part by the grant VEGA 1/7155/20.

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

Access this chapter

Log in via an institution
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 Science Publishers Ltd., London, 1994

    MATH  Google Scholar 

  2. B. Rovan, A framework for studying grammars, in Lecture notes in Computer Science 118, Springer Verlag, 1981, pp. 473–482

    Google Scholar 

  3. J. Hromkovič, Communication Complexity and Parallel Computing, Springer Verlag, 1997

    Google Scholar 

  4. P. Gvozdjak, B. Rovan, Time-Bounded Parallel Rewriting, in Development in Language Theory II (J. Dassow, G. Rozenberg, A. Salomaa eds.),World Scientific 1996, pp. 79–87.

    Google Scholar 

  5. Gh. Păun, L. Santean, Parallel communicating grammar systems: the regular case. An. Univ. Buc., Ser. Mat.-Inf. 38(1989), pp. 55–63.

    MATH  Google Scholar 

  6. E. Csuhaj-Varjú, Gy. Vaszil, An annotated bibliography of Grammar Systems. http://www.sztaki.hu/mms/bib.html

  7. M. Slašt’an, Parallel Communicating Grammar Systems, Master Thesis, Dept. of Computer Science Comenius University, 2000 (http://www.dcs.fmph.uniba.sk/~rovan/thesis.ps)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská Dolina, 842 48, Bratislava, Slovakia

    Branislav Rovan & Marián Slašt’an

Authors
  1. Branislav Rovan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marián Slašt’an
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rovan, B., Slašt’an, M. (2002). Eliminating Communication by Parallel Rewriting. 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_33

Download citation

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

  • 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

Search

Navigation