Systems of parallel communicating restarting automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014) no. 1, pp. 3-22.

Several types of systems of parallel communicating restarting automata are introduced and studied. The main result shows that, for all types of restarting automata X, centralized systems of restarting automata of type X have the same computational power as non-centralized systems of restarting automata of the same type and the same number of components. This result is proved by a direct simulation. In addition, it is shown that for one-way restarting automata without auxiliary symbols, systems of degree at least two are more powerful than the component automata themselves. Finally, a lower and an upper bound are given for the expressive power of systems of parallel communicating restarting automata.

DOI : https://doi.org/10.1051/ita/2013046
Classification : 68Q45
Mots clés : parallel communicating system, restarting automaton, language class
@article{ITA_2014__48_1_3_0,
     author = {Vollweiler, Marcel and Otto, Friedrich},
     title = {Systems of parallel communicating restarting automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {3--22},
     publisher = {EDP-Sciences},
     volume = {48},
     number = {1},
     year = {2014},
     doi = {10.1051/ita/2013046},
     mrnumber = {3195786},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ita/2013046/}
}
Vollweiler, Marcel; Otto, Friedrich. Systems of parallel communicating restarting automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014) no. 1, pp. 3-22. doi : 10.1051/ita/2013046. http://www.numdam.org/articles/10.1051/ita/2013046/

[1] H. Bordihn, M. Kutrib and A. Malcher, On the computational capacity of parallel communicating finite automata, in Developments in Language Theory. In vol. 5257 of Lect. Notes Comput. Sci., edited by M. Ito and M. Toyama. Springer, Berlin (2008) 146-157. | MR 2490952 | Zbl 1161.68513

[2] E. Csuhaj-Varjú, J. Dassow, J. Kelemen and G. Pãun, Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers, Newark, NJ, USA (1994). | MR 1475215 | Zbl 0925.68286

[3] E. Csuhaj-Varjú, C. Martín-Vide, V. Mitrana and G. Vaszil, Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci. 11 (2000) 633-650. | MR 1810040 | Zbl 0970.68090

[4] M. Goehring, PC-systems of restarting automata, in Theorietag Automaten und Formale Sprachen 2009, Technical Report 2009/03, edited by J. Mielke, L. Staiger and R. Winter. Universität Halle-Wittenberg, Institut für Informatik (2009) 26-27.

[5] J. Hartmanis, On non-determinancy in simple computing devices. Acta Informatica 1 (1972) 336-344. | MR 317582 | Zbl 0229.68014

[6] P. Jančar, F. Mráz, M. Plátek and J. Vogel, Restarting automata, FCT'95, in vol. 965 of Lect. Notes Comput. Sci., edited by H. Reichel. Springer, Berlin (1995) 283-292. | MR 1459184

[7] 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. | MR 1945313 | Zbl 1066.68069

[8] H. Messerschmidt and F. Otto, Cooperating distributed systems of restarting automata. Int. J. Found. Comput. Sci. 18 (2007) 1333-1342. | MR 2363813 | Zbl 1183.68347

[9] F. Mráz, Lookahead hierarchies of restarting automata. J. Automata, Languages and Combinatorics 6 (2001) 493-506. | MR 1897057 | Zbl 1004.68091

[10] B. Nagy and F. Otto, CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO: ITA 45 (2011) 413-448. | Numdam | MR 2876115 | Zbl 1250.68172

[11] B. Nagy and F. Otto, On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78 (2012) 780-806. | MR 2900034 | Zbl 1279.68167

[12] G. Niemann and F. Otto, Further results on restarting automata, in Words, Languages and Combinatorics, edited by M. Ito and T. Imaoka. World Scientific, Singapore (2003) 352-369. | MR 2028887

[13] F. Otto, Restarting automata, in Recent Advances in Formal Languages and Applications, vol. 25 of Studies in Computational Intelligence, edited by Z. Ésik, C. Martín-Vide and V. Mitrana. Springer, Berlin (2006) 269-303. | Zbl 1116.68044

[14] F. Otto, Asynchronous PC Systems of Pushdown Automata, in Language and Automata Theory and Applications. In vol. 7810 of Lect. Notes Comput. Sci., edited by A.-H. Dediu, C. Martín-Vide and B. Truthe. Springer Berlin/Heidelberg (2013) 456-467. | MR 3090340

[15] G. Pãun and L. Santean, Parallel communicating grammar systems: the regular case. Analele Universitatii din Bucuresti, Seria matematica-informatica 2 (1989) 55-63. | MR 1100348 | Zbl 0749.68048

[16] M. Vollweiler, Asynchronous systems of parallel communicating finite automata, in vol. 294 of 5th Workshop on Non-Classical Models of Automata and Appl., edited by S. Bensch, F. Drewes, R. Freund and F. Otto. books@acg.at, Österreichische Computer Gesellschaft, Wien (2013) 243-257.

[17] M. Vollweiler and F. Otto, Systems of parallel communicating restarting automata, in vol. 290 of 4th Workshop on Non-Classical Models of Automata and Applications, edited by R. Freund, M. Holzer, B. Truthe and U. Ultes-Nitsche. books@acg.at, Österreichische Computer Gesellschaft, Wien (2012) 197-212.