2000 character limit reached
Binary completely reachable automata (2205.09404v2)
Published 19 May 2022 in cs.FL
Abstract: We characterize complete deterministic finite automata with two input letters 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. The characterization leads to a polynomial-time algorithm for recognizing this class of automata.