
diff -r 652065f55d54 -r 4642e2073808 hws/hw03.tex
--- a/hws/hw03.tex	Thu Oct 10 10:43:03 2019 +0100
+++ b/hws/hw03.tex	Thu Oct 10 21:04:38 2019 +0100
@@ -120,7 +120,7 @@
     \end{tikzpicture}
   \end{center}
 
-\item \textbf{(Deleted for 2017, 2018)}
+\item \textbf{(Deleted for 2017, 2018, 2019)}
   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.




