On Repetitive Finite Automata with Translucent Words
By: František Mráz, Friedrich Otto
Potential Business Impact:
Makes computers understand more complex patterns.
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.
Similar Papers
Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
Formal Languages and Automata Theory
Makes computers understand all languages perfectly.
Saturation Problems for Families of Automata
Formal Languages and Automata Theory
Makes computer programs understand repeating patterns faster.
Input-Erasing Two-Way Finite Automata
Formal Languages and Automata Theory
Erases words to understand languages better.