5 citations · 6 across the 3 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2025
On Repetitive Finite Automata with Translucent Words
František Mráz, Friedrich Otto
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 sentin…
cs.FL2024★ 1 cited
Repetitive Finite Automata With Translucent Letters
František Mráz, Friedrich Otto
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 th…
cs.FL2022★ 5 cited
Non-Returning Finite Automata With Translucent Letters
František Mráz, Friedrich Otto
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…