zbMATH — the first resource for mathematics

On the classes of languages accepted by limited context restarting automata. (English) Zbl 1366.68149
Summary: 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.

68Q45 Formal languages and automata
Full Text: DOI