Advertisement

Networks of parallel language processors

  • Erzsébet Csuhaj-Varjú
  • Arto Salomaa
3. Parallel Communicating Grammar Systems
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 3.
    J. Dassow, Gh. Păun, “Regulated Rewriting in Formal Language Theory“, Springer Verlag, Berlin, 1989.Google Scholar
  4. 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. 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. 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. 7.
    W. D. Hillis, “The Connection Machine”, MIT Press, Cambridge, 1985.Google Scholar
  8. 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. 9.
    L. Ilie, A. Salomaa, On regular characterizations of languages by grammar systems, Acta Cybernetica, to appear.Google Scholar
  10. 10.
    J. Karhumäki, Two theorems concerning recognizable N-subsets of σ *, Theoretical Computer Science 1(1976), 317–323.Google Scholar
  11. 11.
    G. Rozenberg, A. Salomaa, “The Mathematical Theory of L Systems“, Academic Press, New York, 1980.Google Scholar
  12. 12.
    A. Salomaa, “Formal Languages”, Academic Press, New York, 1973.Google Scholar
  13. 13.
    P. S. Sapaty, “The WAVE Paradigm”, Internal Report 17/92, Dept. Informatics, Univ. of Karlsruhe, Germany, 1992.Google Scholar
  14. 14.
    ***, “Connection Machine, Model CM-2. Tehnical Summary”, Thinking Machines T. R. HA 87-4, MIT, Cambridge, USA, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
  • Arto Salomaa
    • 2
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary
  2. 2.Academy of Finland and Mathematics DepartmentUniversity of TurkuTurkuFinland

Personalised recommendations