
diff -r 86b2aeae3e98 -r a259eec25156 hws/hw03.tex
--- a/hws/hw03.tex	Fri Oct 16 14:27:20 2015 +0100
+++ b/hws/hw03.tex	Sat Oct 17 11:24:41 2015 +0100
@@ -47,18 +47,20 @@
 
   What is the language recognised by this automaton?
 
-\item Give a non-deterministic finite automaton that can recognise the
-  language $L(a\cdot (a + b)^* \cdot c)$.
+\item Give a non-deterministic finite automaton that can
+      recognise the language $L(a\cdot (a + b)^* \cdot c)$.
 
-\item Given a deterministic finite automata $A(Q, q_0, F, \delta)$,
-  define which language is recognised by this automaton. Can you 
-  define also the language defined by a non-deterministic automaton?
+\item Given a deterministic finite automaton $A(Q, q_0, F,
+      \delta)$, define which language is recognised by this
+      automaton. Can you define also the language defined by a
+      non-deterministic automaton?
 
-\item Given the following deterministic finite automata over the
-  alphabet $\{a, b\}$, find an automaton that recognises the
-  complement language.  (Hint: Recall that for the algorithm from the
-  lectures, the automaton needs to be in completed form, that is have
-  a transition for every letter from the alphabet.)
+\item Given the following deterministic finite automaton over
+      the alphabet $\{a, b\}$, find an automaton that
+      recognises the complement language. (Hint: Recall that
+      for the algorithm from the lectures, the automaton needs
+      to be in completed form, that is have a transition for
+      every letter from the alphabet.)
 
   \begin{center}
     \begin{tikzpicture}[>=stealth',very thick,auto,
@@ -92,9 +94,9 @@
 %find the corresponding minimal automaton. State clearly which nodes
 %can be merged.
 
-\item Given the following non-deterministic finite automaton over the
-  alphabet $\{a, b\}$, find a deterministic finite automaton that
-  recognises the same language:
+\item Given the following non-deterministic finite automaton
+      over the alphabet $\{a, b\}$, find a deterministic
+      finite automaton that recognises the same language:
 
   \begin{center}
     \begin{tikzpicture}[>=stealth',very thick,auto,




