--- a/handouts/ho02.tex	Wed Oct 02 14:05:36 2019 +0100
+++ b/handouts/ho02.tex	Thu Oct 03 11:12:00 2019 +0100
@@ -1,3 +1,4 @@
+% !TEX program = xelatex
 \documentclass{article}
 \usepackage{../style}
 \usepackage{../langs}
@@ -148,7 +149,7 @@
 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 objects. Before we explain 
-the matching algorithm, however, let us have a closer look at what it
+the matching algorithm, let us have a closer look at what it
 means when two regular expressions are equivalent.
 
 \subsection*{Regular Expression Equivalences}