On directable nondeterministic trapped automata
ImrehB., ImrehCs., ItoM. · Acta Cybernetica · 2003
A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can b...