Skip to main content

Networks of parallel language processors

  • 3. Parallel Communicating Grammar Systems
  • Chapter
  • First Online:
New Trends in Formal Languages

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

Abstract

A network of language processors (an NLP system) consists of several language identifying devices (language processors) associated with nodes of a network (in particular case with nodes of a virtual complete graph). The processors rewrite strings (representing the current state of the nodes) according to some prescribed rewriting mode and communicate them along the network via input and output filter languages. In this paper we study properties of NLP systems with L systems in the nodes.

Research supported by the Academy of Finland, Project 11281

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Csuhaj-Varjú, L. Kari, Gh Păun, Test Tube Distributed System based on Splicing, Computers and AI, 15, 2–3(1996), 211–232.

    Google Scholar 

  2. E. Csuhaj-Varjú, J. Kelemen, Gh. Păun, Grammar systems with WAVE-like communication, Computers and AI, 1996, 15, 5(1996), 419–436.

    Google Scholar 

  3. J. Dassow, Gh. Păun, “Regulated Rewriting in Formal Language Theory“, Springer Verlag, Berlin, 1989.

    Google Scholar 

  4. L. Errico, “WAVE: An Overview of the Model and the Language”, CSRG, Dept. Electronic and Electr. Eng., Univ. of Surrey, UK, 1993.

    Google Scholar 

  5. L. Errico, C. Jesshope, Towards a new architecture for symbolic processing, in “Artificial Intelligence and Information-Control Systems of Robots '94” (I. Plander, ed.), World Sci. Publ., Singapore, 1994, 31–40.

    Google Scholar 

  6. S. E. Fahlman, G. E. Hinton, T. J. Seijnowski, Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines, in “Proc. AAAI National Conf. on AI”, William Kaufman, Los Altos, 1983, 109–113.

    Google Scholar 

  7. W. D. Hillis, “The Connection Machine”, MIT Press, Cambridge, 1985.

    Google Scholar 

  8. L. Ilie, Collapsing hierarchies in parallel communicating grammar systems with communication by command, Computers and AI, 15, 2–3(1996), 173–184.

    Google Scholar 

  9. L. Ilie, A. Salomaa, On regular characterizations of languages by grammar systems, Acta Cybernetica, to appear.

    Google Scholar 

  10. J. Karhumäki, Two theorems concerning recognizable N-subsets of σ *, Theoretical Computer Science 1(1976), 317–323.

    Google Scholar 

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

    Google Scholar 

  12. A. Salomaa, “Formal Languages”, Academic Press, New York, 1973.

    Google Scholar 

  13. P. S. Sapaty, “The WAVE Paradigm”, Internal Report 17/92, Dept. Informatics, Univ. of Karlsruhe, Germany, 1992.

    Google Scholar 

  14. ***, “Connection Machine, Model CM-2. Tehnical Summary”, Thinking Machines T. R. HA 87-4, MIT, Cambridge, USA, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Csuhaj-Varjú, E., Salomaa, A. (1997). Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics