Lookahead hierarchies of restarting automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
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
Restarting automata with auxiliary symbols and small lookahead
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 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 |
We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective (left-) monotone restarting automaton models characterise the context-free languages and that the respective right-leftmonotone restarting automata characterise the linear languages both with just lookahead length 2.