72/122
\begin{frame}{Exercise (4)}
  \bigskip
  (Individually, 4 minutes)

  \begin{exampleblock}{}
  Show that the following languages are regular.
  \medskip
  
  \emph{Construct deterministic finite automata} for the languages:
  \begin{talign}
    \{\, w\in\{a,b\}^*\mid w \text{ contains the subword }bab \,\}
  \end{talign}
  and
  \begin{talign}
    \{\, w\in\{a,b\}^*\mid w \text{ does \emph{not} contain the subword } bab \,\}
  \end{talign}
  \end{exampleblock}
  \begin{center}
  \includegraphics[height=35mm]{images/thinking.jpg}
  \end{center}
  \vspace{10cm}
\end{frame}