Systems of parallel communicating restarting automata
Accepted: 11 December 2013
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.
Mathematics Subject Classification: 68Q45
Key words: Parallel communicating system / restarting automaton / language class
© EDP Sciences 2014