Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds.

Robert Ferens, Marek Szykula

Browse the full ICALP paper archive.