Returning and non-returning parallel communicating finite automata are equivalent
Choudhary, Ashish ; Krithivasan, Kamala ; Mitrana, Victor
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007), p. 137-145 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

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.

Publié le : 2007-01-01
DOI : https://doi.org/10.1051/ita:2007014
Classification:  68Q45,  68Q68 
@article{ITA_2007__41_2_137_0,
     author = {Choudhary, Ashish and Krithivasan, Kamala and Mitrana, Victor},
     title = {Returning and non-returning parallel communicating finite automata are equivalent},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {41},
     year = {2007},
     pages = {137-145},
     doi = {10.1051/ita:2007014},
     mrnumber = {2350640},
     zbl = {pre05235504},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2007__41_2_137_0}
}

Choudhary, Ashish; Krithivasan, Kamala; Mitrana, Victor. Returning and non-returning parallel communicating finite automata are equivalent. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) pp. 137-145. doi : 10.1051/ita:2007014. http://gdmltest.u-ga.fr/item/ITA_2007__41_2_137_0/

[1] A. O. Buda, Multiprocessor automata. Inform. Proces. Lett. 25 (1977) 257-261. | Zbl 0653.68044

[2] E. Csuhaj-Varju, J. Dassow, J. Kelemen and Gh. Paun, Grammar Systems. A grammatical approach to distribution and cooperation. Gordon and Breach (1994). | MR 1475215 | Zbl 0925.68286

[3] E. Csuhaj-Varju, C. Martin-Vide, V. Mitrana and G. Vaszil, Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci. 11 (2000) 633-650. | Zbl 0970.68090

[4] J. Dassow and V. Mitrana, stack cooperation in multi-stack pushdown automata. J. Comput. Syst. Sci. 58 (1999) 611-621. | Zbl 0939.68070

[5] J. Dassow, Gh. Paun and G. Rozenberg, Grammar systems, in [9].

[6] J. Hartmanis, On nondeterminancy in simple computing devices. Acta Inform. 1 (1972) 336-344. | Zbl 0229.68014

[7] O.H. Ibarra, On two-way multihead automata. J. Comput. Syst. Sci. 7 (1973) 28-36. | Zbl 0256.68028

[8] C. Martín-Vide, A. Mateescu and V. Mitrana, Parallel finite automata systems communicating by states. Int. J. Found. Comput. Sci. 13 (2002) 733-749. | Zbl 1066.68069

[9] G. Rozenberg, A. Salomaa (eds.), The Handbook of Formal Languages, Springer-Verlag (1997). | Zbl 0866.68057