A series of slowly synchronizing automata with a zero state over a small alphabet

For each integer n⩾8, we construct an n-state synchronizing automation with a zero state and only 2 input letters such that the minimum length of reset words for the automaton is .