Non-returning deterministic and nondeterministic finite automata with translucent letters
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10477032" target="_blank" >RIV/00216208:11320/23:10477032 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=s~8LVyCHmD" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=s~8LVyCHmD</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1051/ita/2023009" target="_blank" >10.1051/ita/2023009</a>
Alternative languages
Result language
angličtina
Original language name
Non-returning deterministic and nondeterministic finite automata with translucent letters
Original language description
Here, we propose a variant of the nondeterministic finite automaton with translucent letters (NFAwtl), which, after reading and deleting a letter, does not return to the left end of its tape, but instead continues from the position of the letter just deleted. When the end-of-tape marker is reached, our automaton can decide whether to accept, reject, or continue, which means that it reads the remaining tape contents again from the beginning. This type of automaton, called a non-returning finite automaton with translucent letters or an nrNFAwtl, is strictly more expressive than the NFAwtl. We study the expressive capacity of this type of automaton and that of its deterministic variant, comparing them to various other types of finite automata that do not simply read their input from left to right. Also, we are interested in the closure properties of the resulting classes of languages and in the complexity of the fixed membership problem.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
RAIRO - Theoretical Informatics and Applications
ISSN
0988-3754
e-ISSN
2804-7346
Volume of the periodical
57
Issue of the periodical within the volume
October
Country of publishing house
FR - FRANCE
Number of pages
35
Pages from-to
8
UT code for WoS article
001097977100002
EID of the result in the Scopus database
2-s2.0-85176091681