Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete.

Elena V. Pribavkina, Emanuele Rodaro

Browse the full CiE paper archive.