Complexity of checking whether two automata are synchronized by the same language

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. 
DOI: 10.1007/978-3-319-09704-6_27

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Maslennikova2014ComplexityOC, title={Complexity of checking whether two automata are synchronized by the same language}, author={Marina I. Maslennikova}, booktitle={DCFS}, year={2014} }