Fachbereich Elektrotechnik/Informatik, Universität
2 Charles University, Faculty of Mathematics and Physics, Department of Computer Science, Malostranské nám. 25, 11800 Praha 1, Czech Republic
Accepted: 8 January 2014
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 configuration that corresponds to input w, the word w is reduced to the empty word by 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.
Mathematics Subject Classification: 68Q45
Key words: Restarting automaton / contextual rewriting / McNaughton family of languages
Some of the results of this paper have been announced at NCMA 2012 in Fribourg, Switzerland, August 2012. An extended abstract appeared in the proceedings of that conference .
This paper was prepared while the first author was visiting at Charles University in Prague. He gratefully acknowledges the hospitality of the Faculty of Mathematics and Physics.
© EDP Sciences 2014