Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-26T13:09:22.355Z Has data issue: false hasContentIssue false
  • English
  • Français

Systems of parallel communicating restartingautomata

Published online by Cambridge University Press:  21 January 2014

Marcel Vollweiler  and
Friedrich Otto
Marcel Vollweiler
Affiliation:
Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109 Kassel, Germany. [email protected],[email protected]
Friedrich Otto
Affiliation:
Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109 Kassel, Germany. [email protected],[email protected]
Get access

Abstract

Several types of systems of parallel communicating restarting automata are introduced andstudied. The main result shows that, for all types of restarting automata X, centralizedsystems of restarting automata of type X have the same computational power asnon-centralized systems of restarting automata of the same type and the same number ofcomponents. This result is proved by a direct simulation. In addition, it is shown thatfor one-way restarting automata without auxiliary symbols, systems of degree at least twoare more powerful than the component automata themselves. Finally, a lower and an upperbound are given for the expressive power of systems of parallel communicating restartingautomata.

Keywords

Parallel communicating systemrestarting automatonlanguage class
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 48 , Issue 1: Non-Classical Models of Automata and Applications (NCMA 2012) , January 2014 , pp. 3 - 22
Copyright
© EDP Sciences 2014

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

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.
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).
Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V. and Vaszil, G., Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci. 11 (2000) 633–650. Google Scholar
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.
Hartmanis, J., On non-determinancy in simple computing devices. Acta Informatica 1 (1972) 336–344. Google Scholar
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.
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. Google Scholar
Messerschmidt, H. and Otto, F., Cooperating distributed systems of restarting automata. Int. J. Found. Comput. Sci. 18 (2007) 1333–1342. Google Scholar
Mráz, F., Lookahead hierarchies of restarting automata. J. Automata, Languages and Combinatorics 6 (2001) 493–506. Google Scholar
Nagy, B. and Otto, F., CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO: ITA 45 (2011) 413–448. Google Scholar
Nagy, B. and Otto, F., On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78 (2012) 780–806. Google Scholar
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.
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.
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.
Pãun, G. and Santean, L., Parallel communicating grammar systems: the regular case. Analele Universitatii din Bucuresti, Seria matematica-informatica 2 (1989) 55–63. Google Scholar
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. [email protected], Österreichische Computer Gesellschaft, Wien (2013) 243–257.
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. [email protected], Österreichische Computer Gesellschaft, Wien (2012) 197–212.