--- a/hw04.tex	Wed Oct 24 03:40:50 2012 +0100
+++ b/hw04.tex	Wed Oct 24 03:42:09 2012 +0100
@@ -63,7 +63,7 @@
 (Hint: You can assume you are already given a regular expression written \texttt{ALL},
 that can recognise any character.)
 
-\item Geven the alphabet $\{a,b\}$. Draw the automaton that has two states, say  $q_0$ and $q_1$.
+\item Given the alphabet $\{a,b\}$. Draw the automaton that has two states, say  $q_0$ and $q_1$.
 The starting state is $q_0$ and the final state is $q_1$. The transition
 function is given by