Cooperating Distributed Systems of Restarting Automata

Here we introduce cooperating distributed systems of restarting automata and establish that in mode = 1 they correspond to the non-forgetting restarting automaton.

[1]  Friedrich Otto,et al.  Shrinking Restarting Automata , 2007, Int. J. Found. Comput. Sci..

[2]  Karel Oliva,et al.  The Computational Complexity of Rule-Based Part-of-Speech Tagging , 2003, TSD.

[3]  Frantisek Mráz,et al.  Restarting Automata , 1995, FCT.

[4]  Friedrich Otto.  Restarting Automata and Their Relations to the Chomsky Hierarchy , 2003, Developments in Language Theory.

[5]  Gheorghe Paun,et al.  Grammar Systems , 1997, Handbook of Formal Languages.

[6]  Martin Plátek,et al.  RESTARTING AUTOMATA: MOTIVATIONS AND APPLICATIONS , 2007 .

[7]  Erzsébet Csuhaj-Varjú,et al.  On Cooperating/Distributed Grammar Systems , 1990, J. Inf. Process. Cybern..