Sequential monotonicity for restarting automata

As already 2- monotone R- automata accept NP- complete languages, we introduce a restricted variant of j- monotonicity for restarting automata, called sequential j- monotonicity. For restarting automata without auxiliary symbols, this restricted variant still yields infinite hierarchies. However, for restarting automata with auxiliary symbols, all degrees of sequential monotonicity collapse to the first level, implying that RLWW- automata that are sequentially monotone of degree j for any j >= 1 only accept context- free languages.