Modifying the upper bound on the length of minimal synchronizing word

A. N. Trahtman

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…