On Repetitive Finite Automata with Translucent Words
Formal Languages and Automata Theory
2025-07-22 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2507.15315,
title = {On Repetitive Finite Automata with Translucent Words},
author = {František Mráz and Friedrich Otto},
journal= {arXiv preprint arXiv:2507.15315},
year = {2025}
}
Comments
In Proceedings NCMA 2025, arXiv:2507.14082