The Book of Traces
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
An automata-theoretical characterization of context-free trace languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Globally deterministic CD-systems of stateless R(1)-automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Characterizing the regular languages by nonforgetting restarting automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On CD-systems of stateless deterministic R-automata with window size one
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.