Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have