On Monotonic Directable Nondeterministic Automata
Balázs Imreh, Csanád Imreh, Masami Itō · Journal of automata, languages and combinatorics · 2003
A finite automaton is called directable if it has an input word which takes it from every state into the same state. Directability of nondeterministic (n.d.) automata can be defined in different ways. In [7], three notions of directability, D1-, D2-, and D3-directability, are introduced. Here, for each $i = 1,2,3$, we present sharp bounds for the maximal lengths of the shortest D$i$-directing words of $n$-state monotonic D$i$-directable n. d. automata.