Restarting Automata, Marcus Grammars and Context-Free Languages

Abstract: We investigate the computational power of several types of restarting automata - nondeterministic,deterministic; monotonic; normal - and compare them to (deterministic)context-free languages. The relation between restarting automata and Marcuscontextual grammars is discussed and a class of contextual grammars which can becharacterized by normal restarting automata is dened.