Skip to main content
Springer Nature Link
Log in

Some Remarks on Networks of Parallel Language Processors

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1424))

Included in the following conference series:

Abstract

Networks of parallel language processors form a special type of grammar systems where derivation steps in the mode of L systems and communication steps alternate. We prove that, given an arbitrary system, an equivalent system with at most three components can be constructed. This improves a result of [2]. Furthermore we consider the function f(m) which gives the number of words generated in m steps. We relate this function to growth functions of D0L systems and prove the undecidability of the equivalence with respect to this function.

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.

Similar content being viewed by others

References

  1. E. Csuhaj-Varju, J. Dassow, J. Kelemen and Gh. Paun, Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publisher, Yverdon, Switzerland, 1994.

    MATH  Google Scholar 

  2. E. Csuhaj-Varju and A. Salomaa, Networks on parallel language processors. In: Gh. Paun and A. Salomaa (eds.), New Trends in Formal Languages. LNCS 1218, Springer-Verlag, 1997, 299–318.

    Google Scholar 

  3. J. Dassow, Some remarks on networks of parallel language processors. Techn. report, University of Magdeburg, 1998.

    Google Scholar 

  4. J. Dassow, Gh. Paun and G. Rozenberg, Grammar systems. In: G. Rozenberg and A. Salomaa (eds.), Handbook on Formal Languages, Vol. 2, Springer-Verlag, Berlin, 1997, 155–213.

    Google Scholar 

  5. G. T. Herman and G. Rozenberg, Developmental Systems and Languages. North-Holland Publ. Co., Amsterdam, 1975.

    MATH  Google Scholar 

  6. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, D-39016, Magdeburg, Germany

    Jürgen Dassow

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-665, Warszawa, Poland

    Lech Polkowski

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J. (1998). Some Remarks on Networks of Parallel Language Processors. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics