On the Clases of Languages Accepted by Limited Context Restarting Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10290088" target="_blank" >RIV/00216208:11320/14:10290088 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1051/ita/2014001" target="_blank" >http://dx.doi.org/10.1051/ita/2014001</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1051/ita/2014001" target="_blank" >10.1051/ita/2014001</a>

Result language
angličtina
Original language name
On the Clases of Languages Accepted by Limited Context Restarting Automata
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)