Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

PARALLEL COMMUNICATING AUTOMATA SYSTEMS -A SURVEY

  • Carlos Martin-Vide (Research Group in Mathematical Lingusitics and Language Engineering and of the Department of Romance Philologies at the University of Tarragonaa) ;
  • Victor Mitrana (Facultyof Mathematics of the University of Bucharest)
  • Published : 2000.05.01

⟨ Previous Next ⟩

Abstract

A parallel communicating automata system is an accepting device based on the communications between more automata working in parallel. It consists of several automata corking 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 problem sand directions for future research are finally pointed out.

Keywords

References

  1. Intern. J. of Computer Mathematics v.30 The modular grammars A. Atanasiu;V. Mitrana
  2. Inform. Proces. Lett. v.25 Multiprocessor automata A. O. Buda
  3. Intern. J. Foundations of Computer Science v.7 Multi-push-down languages and grammars L. Breveglieri;A. Cherubini;C. Citrini;S. Crespi Reghizzi
  4. J. Comput. System Sci. v.52 A polynomial-time parsing algorithm for k-depth languages A. Cherubini;P. San Pietro
  5. Journal of ACM v.18 Characterizations of pushdown machines in terms of time - bounded computers S. A. Cook
  6. J. of Information Processing and Cybernetics (EIK) v.26 On cooperating/distributed grammar systems E. Csuhaj-Varju;J. Dassow;J. Kelemen;Gh. Paun
  7. Gordon and Breach Grammar Systems. A grammatical approach to distribution and cooperation E. Csuhaj-Varju;J. Dassow;J. Kelemen;Gh. Paun
  8. submitted Parallel communicating push-down automata systems E. Csuhaj-Varju;C. Martin-Vide;V. Mitrana;G. Vaszil
  9. J. Comput. System Sci. v.58 Stack cooperation in multi-stack pushdown automata J. Dassow;V. Mitrana
  10. in The Handbook of AI v.4 Cooperative distributed problem solving E. H. Durfee et all;A. Barr(eds.);P. R. Cohen(eds.);E. A. Feigenbaum(eds.)
  11. J. of ACM 27 Fixed point languages, equality languages, and representations of recursively enumerable languages J. Engelfriet;G. Rozenberg
  12. New Generation Computing v.3 Computationally relevant properties of natural languages and their grammars G. Gazdar;G. K. Pullum
  13. Acta Informatica v.1 On nondeterminancy in simple computing devices J. Hartmanis
  14. Introduction to Formal Language Theory M. A. Harrison
  15. J. Comput. System Sci. v.7 One two-way multihead automata O. H. Ibarra
  16. Inform. Process Lett. v.3 A note on semilinear sets and bounded-reversal multihead pushdown automata O. H. Ibarra
  17. Computational and Theoretic Perspectives How much context-sensitivity is required to provide reasonable structural descriptions? Tree adjoining grammars. In Natural Language Processing: Psycholinguistic A. K. Joshi;D. R. Dowty et al.(eds.)
  18. submitted Some undecidable problems for parallel communicating finite automata systems C. Martin-Vide;V. Mitrana
  19. Mathematical Methods in Linguistics B. H. Partee;A. ter Meulen;R. E. Wahl
  20. submitted Parallel finite automata systems communicating by states A. Mateescu;V. Mitrana;A. Salomaa
  21. Ann. Univ. Bucharest, Ser. Matem.-Inform. v.38 Parallel communicating grammar systems: the regular case Gh. Paun;L. Santean
  22. DNA Computing. New Computing Paradigms G. Paun;G. Rozenberg;A. Salomaa
  23. The Handbook of Formal Languages G. Rozenberg;A. Salomaa (eds.)
  24. R.A.I.R.O. Informatique theorique v.11 Some remarks on multihead automata I. H. Sudborough
  25. Journal of ACM v.25 k+1 heads are better than k A. C. Yao;R. L. Rivest