no. 2
Returning and non-returning parallel communicating finite automata are equivalent
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) no. 2, pp. 137-145.

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.

DOI : 10.1051/ita:2007014
Classification : 68Q45, 68Q68
Mots clés : formal languages, parallel communicating finite automata system, multihead finite automaton, computational power 
@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},
     pages = {137--145},
     publisher = {EDP-Sciences},
     volume = {41},
     number = {2},
     year = {2007},
     doi = {10.1051/ita:2007014},
     mrnumber = {2350640},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ita:2007014/}
}
TY  - JOUR
AU  - Choudhary, Ashish
AU  - Krithivasan, Kamala
AU  - Mitrana, Victor
TI  - Returning and non-returning parallel communicating finite automata are equivalent
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2007
SP  - 137
EP  - 145
VL  - 41
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ita:2007014/
DO  - 10.1051/ita:2007014
LA  - en
ID  - ITA_2007__41_2_137_0
ER  - 
%0 Journal Article
%A Choudhary, Ashish
%A Krithivasan, Kamala
%A Mitrana, Victor
%T Returning and non-returning parallel communicating finite automata are equivalent
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2007
%P 137-145
%V 41
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ita:2007014/
%R 10.1051/ita:2007014
%G en
%F 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) no. 2, pp. 137-145. doi : 10.1051/ita:2007014. http://archive.numdam.org/articles/10.1051/ita:2007014/

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

[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 | Zbl

[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

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

[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

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

[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

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

Cité par Sources :