From: Mart Lubbers <mart@martlubbers.net>
Date: Mon, 2 Feb 2015 14:57:58 +0000 (+0100)
Subject: thing
X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=7db9ed7ade74ac4b29c90bda232a724c1301a628;p=bsc-thesis1415.git

thing
---

diff --git a/thesis2/3.methods.tex b/thesis2/3.methods.tex
index 0b16d52..3a6b28b 100644
--- a/thesis2/3.methods.tex
+++ b/thesis2/3.methods.tex
@@ -64,9 +64,12 @@ which there is no graph $G'$ that has less paths and $\mathcal{L}(G)=\mathcal{L
 The algorithm of building DAWGs is an iterative process that goes roughly in
 three steps. We start with the null graph that can be described by
 $G_0=(\{q_0\},\{q_0\},\{\}\{\})$ and does not contain any edges, one node and
-$\mathcal{L}(G_0)=\emptyset$
+$\mathcal{L}(G_0)=\emptyset$. The first word that is added to the graph will be
+added in a naive way. We just create a new node for every transition of
+character and we mark the last node as final. From then on all words are added
+using a stepwise approach.
 \begin{itemize}
-	\item
+	\item