Transductions computed by PC-systems of monotone deterministic restarting automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Characterizing the regular languages by nonforgetting restarting automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Characterizing the rational functions by restarting transducers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
The non-forgetting restarting automaton is an extension of the restarting automaton that is obtained by combining the restart operation with a change of the internal state just like the other operations. Thus, when executing a restart operation a non-forgetting restarting automaton is not forced to reset its internal state to its initial state. We analyze the expressive power of the deterministic variants of this model. As our main result we establish a hierarchy of language classes that are characterized by various types of monotone deterministic non-forgetting restarting automata. This hierarchy ranges from the deterministic context-free languages to the so-called left-to-right regular languages. In particular, we show that for monotone deterministic non-forgetting restarting automata, the $\textsf{RRWW}$-model is strictly more powerful than the $\textsf{RWW}$-model. This is the first time that for a particular type of restarting automaton the expressive power of the $\textsf{RRWW}$-variant is separated from the expressive power of the corresponding $\textsf{RWW}$-variant.