Non-Returning 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%2F22%3A10456315" target="_blank" >RIV/00216208:11320/22:10456315 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4204/EPTCS.367.10" target="_blank" >https://doi.org/10.4204/EPTCS.367.10</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.367.10" target="_blank" >10.4204/EPTCS.367.10</a>
Alternative languages
Result language
angličtina
Original language name
Non-Returning 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 rather continues from the position of the letter just deleted. When the end-of-tape marker is reached, our automaton can decide whether to accept, to reject, or to continue, which means that it again reads the remaining tape contents 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. Also we are interested in closure properties of the resulting classes of languages and in decision problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
2022
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
Article name in the collection
Electronic Proceedings in Theoretical Computer Science, EPTCS
ISBN
—
ISSN
2075-2180
e-ISSN
—
Number of pages
17
Pages from-to
143-159
Publisher name
Open Publishing Association
Place of publication
sydney
Event location
Debrecén
Event date
Aug 26, 2022
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—