%0 Journal Article
%T Restarting Automata with Auxiliary Symbols and Small Lookahead
%A Natalie Schluter
%J Computer Science
%D 2011
%I arXiv
%X 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 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.
%U http://arxiv.org/abs/1101.1640v3