Abstract
A deterministic finite-state automaton A is said to be synchronizing if there is a synchronizing word, i.e. a word that takes all the states of the automaton A to a particular one. We consider synchronizing automata whose language of synchronizing words is finitely generated as a two-sided ideal in Σ*. Answering a question stated in [1], here we prove that recognizing such automata is a PSPACE-complete problem. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Pribavkina, E. V., & Rodaro, E. (2011). Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6735 LNCS, pp. 230–238). https://doi.org/10.1007/978-3-642-21875-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
