hws/hw01.tex
changeset 444 3056a4c071b0
parent 438 84608b4b3578
child 498 ea47c3b8f35f
--- a/hws/hw01.tex	Tue Oct 04 15:09:08 2016 +0100
+++ b/hws/hw01.tex	Fri Oct 07 22:08:03 2016 +0100
@@ -54,10 +54,10 @@
       the strings in $A$ is the empty string, for example $A =
       \{[a], [b], [c], []\}$.
 
-\item How many basic regular expressions are there to match
-      the string $abcd$? (ii) How many if they cannot include
-      $\ONE$ and $\ZERO$? (iii) How many if they are also not
-      allowed to contain stars? (iv) How many if they are also
+\item (1)How many basic regular expressions are there to match
+      the string $abcd$? (2) How many if they cannot include
+      $\ONE$ and $\ZERO$? (3) How many if they are also not
+      allowed to contain stars? (4) How many if they are also
       not allowed to contain $\_ + \_$?
 
 \item When are two regular expressions equivalent? Can you
@@ -68,7 +68,7 @@
       $[b]$.
 
 \item What is meant by the notions \emph{evil regular expressions}
-      and \emph{catastrophic backtracking}? 
+      and by \emph{catastrophic backtracking}? 
 
 \item \POSTSCRIPT  
 \end{enumerate}