Modifying the upper bound on the length of minimal synchronizing word

36Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A word w is called synchronizing (recurrent, reset, magic, directable) word of deterministic finite automaton (DFA) if w sends all states of the automaton to a unique state. In 1964 Jan Černy found a sequence of n-state complete DFA possessing a minimal synchronizing word of length (n - 1)2. He conjectured that it is an upper bound on the length of such words for complete DFA. Nevertheless, the best upper bound (n3 - n)/6 was found almost 30 years ago. We reduce the upper bound on the length of the minimal synchronizing word to n(7n2 + 6n - 16)/48. An implemented algorithm for finding synchronizing word with restricted upper bound is described. The work presents the distribution of all synchronizing automata of small size according to the length of an almost minimal synchronizing word. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Trahtman, A. N. (2011). Modifying the upper bound on the length of minimal synchronizing word. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6914 LNCS, pp. 173–180). https://doi.org/10.1007/978-3-642-22953-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free