Skip to main content
SpringerLink
Log in

Parallel communicating automata systems — A survey

  • Invited Article
  • Published:
Korean Journal of Computational & Applied Mathematics Aims and scope Submit manuscript

Abstract

A parallel communicating automata system is an accepting device based on the communication between more automata working in parallel. It consists of several automata working independently but communicating with each other by request. We survey several variants of parallel communicating automata systems with respect to their computational power. Other aspects like decidability and complexity matters are also briefly discussed. Some open problems and directions for future research are finally pointed out.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Atanasiu, V. Mitrana,The modular grammars, Intern. J. of Computer Mathematics 30 (1989), 17–35.

    Article  MATH  Google Scholar 

  2. A. O. Buda,Multiprocessor automata, Inform. Proces. Lett. 25 (1977), 257–261.

    Article  MathSciNet  Google Scholar 

  3. L. Breveglieri, A. Cherubini, C. Citrini, S. Crespi Reghizzi,Multi-push-down languages and grammars, Intern. J. Foundations of Computer Science 7 (1996), 253–291.

    Article  MATH  Google Scholar 

  4. A. Cherubini, P. San Pietro,A polynomial-time parsing algorithm for k-depth languages, J. Comput. System Sci. 52 (1996), 61–79.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. A. Cook,Characterizations of pushdown machines in terms of time — bounded computers, Journal of ACM 18 (1971), 4–18.

    Article  MATH  Google Scholar 

  6. E. Csuhaj-Varjú, J. Dassow,On cooperating/distributed grammar systems, J. of Information Processing and Cybernetics (EIK), 26 (1990), 49–63.

    MATH  Google Scholar 

  7. E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Păun,Grammar Systems. A grammatical approach to distribution and cooperation. Gordon and Breach, 1994.

  8. E. Csuhaj-Varju, C. Martín-Vide, V. Mitrana, G. Vaszil,Parallel communicating pushdown automata systems, submitted.

  9. J. Dassow, V. Mitrana,Stack cooperation in multi-stack pushdown automata. J. Comput. System Sci. 58 (1999), 611–621.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. H. Durfee et all,Cooperative distributed problem solving. in The Handbook of AI, vol. 4 (A. Barr, P. R. Cohen, E. A. Feigenbaum eds.), Addison-Wesley, Reading Mass., 1989.

    Google Scholar 

  11. J. Engelfriet, G. Rozenberg,Fixed point languages, equality languages, and representations of recursively enumerable languages, J. of ACM 27 (1980), 499–518.

    Article  MATH  MathSciNet  Google Scholar 

  12. G. Gazdar, G. K. Pullum,Computationally relevant properties of natural languages and their grammars, New Generation Computing 3 (1985), 273–306.

    Article  Google Scholar 

  13. J. Hartmanis,On nondeterminancy in simple computing devices, Acta Informatica 1 (1972), 336–344.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. A. Harrison,Introduction to Formal Language Theory, Addison-Wesley Publ. Co., 1978.

  15. O. H. Ibarra,One two-way multihead automata, J. Comput. System Sci. 7 (1973), 28–36.

    MATH  MathSciNet  Google Scholar 

  16. O. H. Ibarra,A note on semilinear sets and bounded-reversal multihead pushdown automata, Inform. Process Lett. 3 (1974), 25–28.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. K. Joshi,How much context-sensitivity is required to provide reasonable structural descriptions? Tree adjoining grammars. In Natural Language Processing: Psycholinguistic, Computational and Theoretic Perspectives (D. R. Dowty et al., eds.), Cambridge Univ. Press, New York, 1985, 206–250.

    Google Scholar 

  18. C. Martín-Vide, V. Mitrana,Some undecidable problems for parallel communicating finite automata systems, submitted.

  19. B. H. Partee, A. ter Meulen, R. E. Wahl,Mathematical Methods in Linguistics, Kluwer Academic Publ., Dordrecht, Boston, London, 1990.

    MATH  Google Scholar 

  20. A. Mateescu, V. Mitrana, A. Salomaa,Parallel finite automata systems communicating by states, submitted.

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

    MATH  Google Scholar 

  22. G. Păun, G. Rozenberg, A. Salomaa,DNA Computing. New Computing Paradigms, Springer-Verlag, 1998.

  23. G. Rozenberg, A. Salomaa (eds.),The Handbook of Formal Languages, Springer-Verlag, 1997.

  24. I. H. Sudborough,Some remarks on multihead automata, R.A.I.R.O. Informatique théorique 11 (1977), 181–195.

    MATH  MathSciNet  Google Scholar 

  25. A. C. Yao, R. L. Rivest,k+1 heads are better than k, Journal of ACM 25 (1978), 337–340.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Romance Philologies, University of Tarragona, Spain

    Carlos Martín-Vide (Head of the Research Group in Mathematical Lingusitics and Language Engineering)

  2. Faculty of Mathematics, University of Bucharest, Romania

    Victor Mitrana (Associate Professor)

Authors
  1. Carlos Martín-Vide
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by the Dirección General de Ense nanza Superior e Investigación Cientifica, SB 97-00110508

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martín-Vide, C., Mitrana, V. Parallel communicating automata systems — A survey. Korean J. Comput. & Appl. Math. 7, 237–257 (2000). https://doi.org/10.1007/BF03012191

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03012191

AMS Mathematics Subject Classification

Key word and phrases

Search

Navigation