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-left-monotone restarting automata characterise the linear languages both with just lookahead length 2.
|Title of host publication|| LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications LATA 2011|
|ISBN (Print)||978-3-642-21253-6 |
|Publication status||Published - 2012|
|Series||Lecture Notes in Computer Science|