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. © 2011 Springer-Verlag.
CITATION STYLE
Schluter, N. (2011). Restarting automata with auxiliary symbols and small lookahead. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 499–510). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_40
Mendeley helps you to discover research relevant for your work.