Succinct description of regular languages by weak restarting automata
Information and Computation
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On lookahead hierarchies for monotone and deterministic restarting automata with auxiliary symbols
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Restarting automata with auxiliary symbols and small lookahead
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
Characterizing the rational functions by restarting transducers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the descriptional complexity of the window size for deterministic restarting automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hi-index | 0.00 |