On Repetitive Finite Automata with Translucent Words

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10513172" target="_blank" >RIV/00216208:11320/25:10513172 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.4204/EPTCS.422.5" target="_blank" >https://doi.org/10.4204/EPTCS.422.5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4204/EPTCS.422.5" target="_blank" >10.4204/EPTCS.422.5</a>

Result language

angličtina

Original language name

On Repetitive Finite Automata with Translucent Words

Original language description

We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting or rejecting, but it may change into another state and continue with its computation. We establish that a repetitive DFAwtw already accepts a language that is not even semi-linear, which shows that the property of being repetitive increases the expressive capacity of the DFAwtw and the NFAwtw considerably.

Czech name

—

Czech description

—

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)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2025

Confidentiality

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

Article name in the collection

Electronic Proceedings in Theoretical Computer Science, EPTCS

ISBN

—

ISSN

2075-2180

e-ISSN

—

Number of pages

14

Pages from-to

59-72

Publisher name

Open Publishing Association

Place of publication

S. I.

Event location

Loughborough

Event date

Jul 21, 2025

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

001542234700006