Slowly synchronizing automata with zero and noncomplete sets
Elena V. Pribavkina · Mathematical Notes · 2011
Using the combinatorial properties of noncomplete sets in a free monoid, we construct a series of finite deterministic synchronizing automata with zero for which the shortest synchronizing word has length n 2/4 + n/2 − 1, where n is the number of states.