# HG changeset patch
# User cu
# Date 1506622057 -3600
# Node ID 1af5ec39d00614c40961921290fe2692c8b0fc7a
# Parent  25580bf89ac007c05efe2a3c82040f5c611a51b0
c

diff -r 25580bf89ac0 -r 1af5ec39d006 handouts/ho02.pdf
Binary file handouts/ho02.pdf has changed
diff -r 25580bf89ac0 -r 1af5ec39d006 handouts/ho02.tex
--- a/handouts/ho02.tex	Thu Sep 28 11:04:11 2017 +0100
+++ b/handouts/ho02.tex	Thu Sep 28 19:07:37 2017 +0100
@@ -641,7 +641,7 @@
 StackOverflow is raised. Recall that Python and Ruby (and our first
 version, Scala V1) could only handle $n = 27$ or so in 30
 seconds. We have not tried our algorithm on the second example $(a^*)^* \cdot
-b$---but it is doing OK with it.
+b$---I leave this to you.
 
 
 The moral is that our algorithm is rather sensitive to the
@@ -731,7 +731,7 @@
 a^{\{n\}}$.  We need a third of this time to do the same with strings
 up to 11,000 \texttt{a}s.  Similarly, Java and Python needed 30
 seconds to find out the regular expression $(a^*)^* \cdot b$ does not
-match the string of 28 \texttt{a}s. We can do the same in
+match the string of 28 \texttt{a}s. We can do the same in the same amount of time
 for strings composed of nearly 6,000,000 \texttt{a}s: