--- a/hws/hw03.tex	Fri Oct 12 10:16:54 2018 +0100
+++ b/hws/hw03.tex	Sat Oct 13 13:51:28 2018 +0100
@@ -116,7 +116,7 @@
     \end{tikzpicture}
   \end{center}
 
-\item \textbf{(Deleted for 2017)}
+\item \textbf{(Deleted for 2017, 2018)}
   Given the following deterministic finite automaton over the
   alphabet $\{0, 1\}$, find the corresponding minimal automaton. In
   case states can be merged, state clearly which states can be merged.