Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
Eugenija A. Bondar, David Casas, Mikhail Vladimirovich Volkov · International Journal of Foundations of Computer Science · 2023
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.