\begin{figure}[t] \centering \input{fig_c4_chain.tex} \caption{The extension method on the \Cerny{} automaton $C_4$ of Figure~\ref{fig:witness} (right), with the exceptional state $x=0$ (thick circle). Each box shows a set of states; its members are grey; an arrow labelled $c$ goes from a set $K$ to its preimage $Kc^{-1}$. As in Remark~\ref{rem:steps}, $t=\alpha_x<1$, and each row, read from right to left, spells its word: the merging letter $a$, then $w_0=abbb$, then $w_1=abbb$; the reset word $w_1w_0a=abbb\,abbb\,a$ has length $1+(n-2)n=9=(4-1)^2$ for $n=4$. The braces mark the two bounds of the orbit lemma (Lemma~\ref{lem:orbit}) used in the proof of Proposition~\ref{prop:caseA}: in each extension both are attained, so it costs exactly $n$ letters.}\label{fig:chain} \end{figure}