\begin{frame}{Exercise: DFA Minimisation}
  \begin{exampleblock}{}
    \begin{center}
      \input{tikz/dfa2.tex}
    \end{center}\vspace{-2ex}
    \begin{enumerate}
    \pause
      \item All states are reachable (nothing to remove).
    \pause
      \item Initial partitioning: $\{\, Q\setminus F, F \,\} = \{\, \{\, q_0, q_1, q_2, q_3 \,\}, \{\, q_4 \,\} \,\}$
        \pause\medskip
        
        Splitting $R = \{\, q_0, q_1, q_2, q_3 \,\}$ with $S = \{\, q_4 \,\}$ and letter $b \in \Sigma$.\\
        \pause
        New partitioning: $\{\, \alert{\{\, q_0 \,\}, \{\, q_1, q_2, q_3 \,\}}, \{\, q_4 \,\} \,\}$.
        \pause\medskip
        
        Splitting $R = \{\, q_1, q_2, q_3 \,\}$ with $S = \{\, q_0 \,\}$ and letter $a \in \Sigma$.\\
        \pause
        New partitioning: $\{\, \{\, q_0 \,\}, \alert{\{\, q_1, q_2 \,\}, \{\, q_3 \,\}}, \{\, q_4 \,\} \,\}$.
        \pause\medskip
        
        Nothing more to split!
    \end{enumerate}
  \end{exampleblock}
  \vspace{10cm}
\end{frame}