Publication at Faculty of Mathematics and Physics |
2005
Abstract
The degree of monotonicity (and the degree of freeness of word-order) 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 type of restarting automaton.