--- a/handouts/ho02.tex	Mon Sep 28 23:47:34 2015 +0100
+++ b/handouts/ho02.tex	Thu Oct 01 21:22:03 2015 +0100
@@ -78,7 +78,7 @@
 can implement an exhaustive test for whether a string is
 member of this set or not. In contrast our matching algorithm
 will operate on the regular expression $r$ and string $s$,
-only, which are both finite. Before we come to the matching
+only, which are both finite objects. Before we come to the matching
 algorithm, however, let us have a closer look at what it means
 when two regular expressions are equivalent.
 
@@ -568,6 +568,8 @@
 \end{tikzpicture}
 \end{center}
 
+\section*{Proofs}
+
 \end{document}