Parametrized syntactic analysis by freely rewriting Restarting Automata

Abstrakt

The degree of monotonicity can serve as a parameter (restriction) for the syntactic analysis by a generalized type of restarting automaton. Here we study the power of such constraints on computations of this restarting automaton.