--- a/hws/hw03.tex	Sat Nov 01 15:06:41 2014 +0000
+++ b/hws/hw03.tex	Sat Nov 01 16:19:05 2014 +0000
@@ -159,6 +159,12 @@
   this automaton. (Hint: If you use Brzozwski's method, you can assume
   Arden's lemma which states that an equation of the form $q = q\cdot r + s$
   has the unique solution $q = s \cdot r^*$.)
+
+\item If a non-deterministic finite automaton (NFA) has
+$n$ states. How many states does a deterministic 
+automaton (DFA) that can recognise the same language
+as the NFA maximal need?
+
 \end{enumerate}
 
 \end{document}