State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.

Stefan Hoffmann

Browse the full LATA paper archive.