CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

Authors:
Friedrich Otto
Affiliations:
Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany 34109
Venue:
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 4
Cited 0

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
On nonforgetting restarting automata that are deterministic and/or monotone

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Quantified Score

Hi-index	0.03

Visualization

Abstract

We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system ${\cal M}$ of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system ${\cal M}'$ of restarting automata of the same type as ${\cal M}$ that, working in the new mode ed, accepts the language $L_{\sf m}({\cal M})$ that $\cal M$ accepts in mode m. Further, we will see that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W).