Article contents
Hierarchies of weakly monotone restarting automata
Published online by Cambridge University Press: 15 April 2005
Abstract
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2005
References
- 4
- Cited by