Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words.

Stefan Hoffmann

Browse the full LATA paper archive.