On the classes of languages accepted by limited context restarting automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014) no. 1, pp. 61-84

Voir la notice de l'article provenant de la source Numdam

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.

DOI : 10.1051/ita/2014001
Classification : 68Q45
Keywords: restarting automaton, contextual rewriting, mcnaughton family of languages
@article{ITA_2014__48_1_61_0,
     author = {Otto, Friedrich and \v{C}erno, Peter and Mr\'az, Franti\v{s}ek},
     title = {On the classes of languages accepted by limited context restarting automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {61--84},
     publisher = {EDP-Sciences},
     volume = {48},
     number = {1},
     year = {2014},
     doi = {10.1051/ita/2014001},
     mrnumber = {3195789},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2014001/}
}
TY  - JOUR
AU  - Otto, Friedrich
AU  - Černo, Peter
AU  - Mráz, František
TI  - On the classes of languages accepted by limited context restarting automata
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2014
SP  - 61
EP  - 84
VL  - 48
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita/2014001/
DO  - 10.1051/ita/2014001
LA  - en
ID  - ITA_2014__48_1_61_0
ER  - 
%0 Journal Article
%A Otto, Friedrich
%A Černo, Peter
%A Mráz, František
%T On the classes of languages accepted by limited context restarting automata
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2014
%P 61-84
%V 48
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita/2014001/
%R 10.1051/ita/2014001
%G en
%F ITA_2014__48_1_61_0
Otto, Friedrich; Černo, Peter; Mráz, František. On the classes of languages accepted by limited context restarting automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014) no. 1, pp. 61-84. doi: 10.1051/ita/2014001

Cité par Sources :