Completely Reachable Automata
arXiv:1607.00554
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.
23 pages, 12 figures. This is an expanded version of the conference paper published in C. Campeanu et al. (eds.), Descriptional Complexity of Formal Systems. DCFS 2016 [Lect. Notes Comp. Sci. 9777], Springer-Verlag, Berlin-Heidelberg-N.Y., 2016, 1-17