Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-25T19:08:59.789Z Has data issue: false hasContentIssue false
  • English
  • Français

Returning and non-returning parallel communicating finite automata are equivalent

Published online by Cambridge University Press:  18 July 2007

Ashish Choudhary ,
Kamala Krithivasan  and
Victor Mitrana
Ashish Choudhary
Affiliation:
Dept of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, 600036 India; ashishc@cse.iitm.ernet.in
Kamala Krithivasan
Affiliation:
Dept of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, 600036 India; kamala@iitm.ernet.in
Victor Mitrana
Affiliation:
Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 010014, Bucharest, Romania. Research Group in Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tarraco 1, 43005, Tarragona, Spain; vmi@urv.net
Get access

Abstract

A parallel communicating automata system consists of several automata working independently in parallel and communicating with each other by request with the aim of recognizing a word. Rather surprisingly, returning parallel communicating finite automata systems are equivalent to the non-returning variants. We show this result by proving the equivalence of both with multihead finite automata. Some open problems are finally formulated.

Keywords

Formal languagesparallel communicating finite automata systemmultihead finite automatoncomputational power
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 41 , Issue 2 , April 2007 , pp. 137 - 145
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Multiprocessor, A. O. Buda automata. Inform. Proces. Lett. 25 (1977) 257–261.
E. Csuhaj-Varju, J. Dassow, J. Kelemen and Gh. Paun, Grammar Systems. A grammatical approach to distribution and cooperation. Gordon and Breach (1994).
Csuhaj-Varju, E., Martin-Vide, C., Mitrana, V. and Vaszil, G., Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci. 11 (2000) 633–650. CrossRef
Dassow, J. and Mitrana, V., stack cooperation in multi-stack pushdown automata. J. Comput. Syst. Sci. 58 (1999) 611–621. CrossRef
J. Dassow, Gh. Paun and G. Rozenberg, Grammar systems, in [9].
Hartmanis, J., On nondeterminancy in simple computing devices. Acta Inform. 1 (1972) 336–344. CrossRef
O.H. Ibarra, On two-way multihead automata. J. Comput. Syst. Sci. 7 (1973) 28–36. CrossRef
Martín-Vide, C., Mateescu, A. and Mitrana, V., Parallel finite automata systems communicating by states. Int. J. Found. Comput. Sci. 13 (2002) 733–749. CrossRef
G. Rozenberg, A. Salomaa (eds.), The Handbook of Formal Languages, Springer-Verlag (1997).