Completely reachable automata: an interplay between automata, graphs, and trees

Evgeniya A. Bondar, David Casas, Mikhail V. Volkov

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.

Knowledge Graph



Sign up or login to leave a comment