# HG changeset patch
# User Christian Urban <urbanc@in.tum.de>
# Date 1351046529 -3600
# Node ID 70dbd83d849c25a320208a13bf07f4e646b15c03
# Parent  3840d09e42715d333fd26e79dfcb87f7e890721a
tuned

diff -r 3840d09e4271 -r 70dbd83d849c hw04.pdf
Binary file hw04.pdf has changed
diff -r 3840d09e4271 -r 70dbd83d849c hw04.tex
--- 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