Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Intersection and union of regular languages and state complexity
Information Processing Letters
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
CD-systems of stateless deterministic r(1)-automata accept all rational trace languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Strictly deterministic CD-systems of restarting automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Here 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 study the expressive power of these systems by relating the class of languages that they accept by mode =1 computations to other well-studied language classes, showing in particular that this class only contains semi-linear languages. Our model can be viewed as a nondeterministic finite-state acceptor with translucent letters, that is, it processes its input in a different way than the usual left-to-right order. In this way all commutative semi-linear languages, and in fact all rational trace languages, can be accepted. In addition, we investigate the closure and non-closure properties of the class of languages accepted by our model and some of its algorithmic properties.