Complexity of checking whether two automata are synchronized by the same language
Formal Languages and Automata Theory
2014-05-15 v1
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.
Keywords
Cite
@article{arxiv.1405.3576,
title = {Complexity of checking whether two automata are synchronized by the same language},
author = {Marina Maslennikova},
journal= {arXiv preprint arXiv:1405.3576},
year = {2014}
}
Comments
12 pages, 4 figures