Publication at Faculty of Mathematics and Physics |
2012
Abstract
In the literature various types of restarting automata have been studied that are based on contextual rewriting. A word w is accepted by such an automaton if, starting from the initial conguration that corresponds to input w, the word w is reduced to the empty word within a finite number of applications of these contextual rewritings.
This approach is reminiscent of the notion of McNaughton families of languages. Here we put the aforementioned types of restarting automata into the context of McNaughton families of languages, relating the classes of languages accepted by these automata in particular to the class GCSL of growing context-sensitive languages and to the class CRL of Church-Rosser languages.