Remarks on Multiple Entry Deterministic Finite Automata
Libor Polák · Journal of automata, languages and combinatorics · 2007
We investigate several aspects of the multiple entry DFAs. We consider their DFA conversion. Further, we show that they appear as minimal NFAs for certain classes of languages. Finally, we deal with their decompositions into disjoint unions of automata with fewer states.