Completely reachable automata: an interplay between automata, graphs, and trees
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs and trees.
cs.FL↗