v0.9a

[bsc-thesis1415.git] / thesis2 / 1.introduction.tex

diff --git a/thesis2/1.introduction.tex b/thesis2/1.introduction.tex
index 7ca6477..366d13a 100644 (file)
--- a/thesis2/1.introduction.tex
+++ b/thesis2/1.introduction.tex
@@ -412,7 +412,7 @@ edgelabels one can construct words. Using graph minimalization big sets of
 words can be stored using a small amouth of storage because edges can be
 re-used to specify transitions. For example the graph in
 Figure~\ref{exampledawg} can describe the language $L$ where all words $w$ that
-are accepted $w\in\{abd, bad, bae\}$.  Testing if a word is present in the DAWG
+are accepted $w\in\{abd, bad, bae\}$. Testing if a word is present in the DAWG
 is the same technique as testing if a node path is present in a normal DAG and
 therefore also falls in the computational complexity class of $\mathcal{O}(L)$.
 This means that it grows linearly with the length of the word.