  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.
