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 PSPACEcomplete problem to check whether the language of reset words for a given automaton coincides with the language of reset words for some particular automaton.