A synchronizing word w for a given synchronizing DFA is called minimal if no proper prefix or suffix of w is synchronizing. We characterize the class of synchronizing automata having finite language of minimal synchronizing words (such automata are called finitely generated). Using this characterization we prove that any such automaton possesses a synchronizing word of length at most 3n - 5. We also prove that checking whether a given DFA A is finitely generated is co-NPhard, and provide an algorithm for this problem which is exponential in the number of states A. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Pribavkina, E. V., & Rodaro, E. (2009). Finitely generated synchronizing automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5457, pp. 672–683). https://doi.org/10.1007/978-3-642-00982-2_57
Mendeley helps you to discover research relevant for your work.