2000 character limit reached
Completely Reachable Automata (1607.00554v1)
Published 2 Jul 2016 in cs.FL
Abstract: 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.