Journal:
:International Journal of Foundations of Computer Science2023
A deterministic finite automaton in which every non-empty set of states occurs as the image whole state under action a suitable input word is called completely reachable. We characterize such automata terms graphs and trees.
