Deterministic Biautomata and Subclasses of Deterministic Linear Languages

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F19%3A00108265" target="_blank" >RIV/00216224:14310/19:00108265 - isvavai.cz</a>
Result on the web
<a href="https://rd.springer.com/chapter/10.1007%2F978-3-030-13435-8_23" target="_blank" >https://rd.springer.com/chapter/10.1007%2F978-3-030-13435-8_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-13435-8_23" target="_blank" >10.1007/978-3-030-13435-8_23</a>

Result language
angličtina
Original language name
Deterministic Biautomata and Subclasses of Deterministic Linear Languages
Original language description
We propose the notion of a deterministic biautomaton, a machine reading an input word from both ends. We focus on various subclasses of deterministic linear languages and give their characterizations by certain subclasses of deterministic biautomata. We use these characterizations to establish closure properties of the studied subclasses of languages and to get basic decidability results concerning them.
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)