Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2011 | inproceedings
Publication
Year of publication: 2011
Volume : 6735 LNCS
Pages : 230-238
Month :
CMUP publication : Yes