hws/hw01.tex
changeset 331 a2c18456c6b7
parent 294 c29853b672fb
child 355 a259eec25156
--- a/hws/hw01.tex	Fri Sep 25 08:51:12 2015 +0100
+++ b/hws/hw01.tex	Fri Sep 25 17:39:02 2015 +0100
@@ -5,6 +5,8 @@
 
 \section*{Homework 1}
 
+\HEADER
+
 \begin{enumerate}
 
 \item {\bf (Optional)} If you want to run the code presented in the
@@ -44,7 +46,7 @@
 
 \item Let $A = \{[a], [b], [c], [d]\}$. How many strings are in $A^4$?
   Consider the case of $A^4$ where one of the strings in $A$ is the 
-  empty string.
+  empty string, for example $A = \{[a], [b], [c], []\}$.
 
 \item How many regular expressions are there to match the string
   $abc$? How many if they cannot include $\epsilon$ and $\varnothing$?