  We present a few results and several open problems concerning complete
deterministic finite automata in which every non-empty subset of the state set
occurs as the image of the whole state set under the action of a suitable input
word.
