Handbook of formal languages, vol. 2
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Recent Advances in Formal Languages and Applications (Studies in Computational Intelligence)
Recent Advances in Formal Languages and Applications (Studies in Computational Intelligence)
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
Globally deterministic CD-systems of stateless R(1)-automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
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 |
A CD-system of restarting automata is called strictly deterministic if all its component systems are deterministic, and if there is a unique successor system for each component. Here we show that the strictly deterministic CD-systems of restarting automata are strictly more powerful than the corresponding deterministic types of restarting automata, but that they are strictly less powerful than the corresponding deterministic types of nonforgetting restarting automata. In fact, we present an infinite hierarchy of language classes based on the number of components of strictly deterministic CD-systems of restarting automata.