Author:
Vollweiler Marcel,Otto Friedrich
Abstract
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.
Subject
Computer Science Applications,General Mathematics,Software
Reference17 articles.
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.
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).
3. PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
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. On non-determinancy in simple computing devices
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asynchronous Parallel Communicating Systems of Pushdown Automata;International Journal of Foundations of Computer Science;2015-08