Abstract
A deterministic finite automaton A is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton A to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of reset words for a given automaton coincides with the language of reset words for some particular automaton. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Maslennikova, M. (2014). Complexity of checking whether two automata are synchronized by the same language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 306–317). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
