Limited context restarting automata and McNaughton families of languages

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10132511" target="_blank" >RIV/00216208:11320/12:10132511 - isvavai.cz</a>
Result on the web
<a href="http://ksvi.mff.cuni.cz/workshop/theorietag2012/files/ProcTt12final_v2opt.pdf" target="_blank" >http://ksvi.mff.cuni.cz/workshop/theorietag2012/files/ProcTt12final_v2opt.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Limited context restarting automata and McNaughton families of languages
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 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.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)