A Note on Černý-Conjecture for Automata over 3-Letter Alphabet
Adam Roman · Journal of automata, languages and combinatorics · 2008
We show that the alphabet size can play an essential role in the issue of automata synchronization. We give an example of 5-state automaton (over 3-letter alphabet) not isomorphic to \v{C}ern{\'{y}}'s one,with the minimal synchronizing word of length $(n-1)^2 = 16$. It is known [2] that there is no such automaton for 2-1etter alphabet.