--- a/handouts/ho02.tex	Mon Oct 07 09:45:11 2013 +0100
+++ b/handouts/ho02.tex	Mon Oct 07 16:59:36 2013 +0100
@@ -179,8 +179,9 @@
 \]
 
 \noindent
-holds, which means our algorithm satisfies the specification. This algorithm can be easily 
-extended for other regular expressions such as $r^{\{n\}}$, $r^?$, $\sim{}r$ and so on.
+holds, which means our algorithm satisfies the specification. This algorithm was introduced by
+Janus Brzozowski in 1964. Its main attractions are simplicity and being fast, as well as
+being easily extendable for other regular expressions such as $r^{\{n\}}$, $r^?$, $\sim{}r$ and so on.
 
 \begin{figure}[p]
 {\lstset{language=Scala}\texttt{\lstinputlisting{../progs/app5.scala}}}