CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
We study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We relate the class of languages that are accepted by mode = 1 computations of CD-systems of such automata to other well-studied language classes, showing in particular that it only consists of semi-linear languages, and that it includes all rational trace languages.
Unable to display preview. Download preview PDF.
- 1.Berstel, J.: Transductions and Context-free Languages. In: Teubner Studienbücher: Informatik. Teubner, Stuttgart (1979)Google Scholar
- 3.Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)Google Scholar
- 4.Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) Automata and Formal Languages, AFL 2008, Proc. Computer and Automation Research Institute, pp. 257–268. Hungarian Academy of Sciences (2008)Google Scholar
- 5.Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Intern. J. Found. Comput. Sci (to appear, 2010); Extended version of Google Scholar
- 8.Otto, F.: Restarting automata. In: Ésik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Berlin (2006)Google Scholar