2000 character limit reached
Complexity of checking whether two automata are synchronized by the same language (1405.3576v1)
Published 14 May 2014 in cs.FL
Abstract: A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton 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.