Repetitive 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%2F24%3A10495067" target="_blank" >RIV/00216208:11320/24:10495067 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4204/EPTCS.407.11" target="_blank" >https://doi.org/10.4204/EPTCS.407.11</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.407.11" target="_blank" >10.4204/EPTCS.407.11</a>
Alternative languages
Result language
angličtina
Original language name
Repetitive Finite Automata With Translucent Letters
Original language description
Here we propose an extension of the (deterministic and the nondeterministic) finite automaton with translucent letters (DFAwtl and NFAwtl), which lies between these automata and their non-returning variants (that is, the nr-DFAwtl and the nr-NFAwtl). This new model works like a DFAwtl or an NFAwtl, but on seeing the end-of-tape marker, it may change its internal state and continue with its computation instead of just ending it, accepting or rejecting. This new type of automaton is called a repetitive deterministic or nondeterministic finite automaton with translucent letters ( RDFAwtl or RNFAwtl). ). In the deterministic case, the new model is strictly more expressive than the DFAwtl, but less expressive than the nr-DFAwtl, while in the nondeterministic case, the new model is equivalent to the NFAwtl.
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
2024
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
18
Pages from-to
150-167
Publisher name
Open Publishing Association
Place of publication
S.l.
Event location
Göttingen
Event date
Aug 12, 2024
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
001318849600012