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

TitleRecognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete
Publication TypeProceedings of international conferences (peer reviewed)
AuthorsPribavkina EV, Rodaro E
[2011-4]

Area / Group: 

Semigroups, Automata and Languages