hws/hw04.tex
changeset 359 db106e5b7c4d
parent 355 a259eec25156
child 401 5d85dc9779b1
--- a/hws/hw04.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw04.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -79,7 +79,7 @@
 Does simplification always preserve the meaning of a regular
 expression? 
      
-\item The Sulzmann algorithm contains the function $mkeps$
+\item The Sulzmann \& Lu algorithm contains the function $mkeps$
       which answers how a regular expression can match the
       empty string. What is the answer of $mkeps$ for the
       regular expressions:    
@@ -93,7 +93,7 @@
   \]
 
 \item What is the purpose of the record regular expression
-  in the Sulzmann algorithm?
+  in the Sulzmann \& Lu algorithm?
   
   
 %\item (Optional) The tokenizer in \texttt{regexp3.scala} takes as