Every entry gotten from the previous step is going to be processing into so
called node-lists. A node-list can be seen as a path graph where every
character and marking has a node. A path graph $G$ is defined as
-$G=(V,n_1,E,n_i)$ where $V=\{n_1, n_2, \cdots, n_{i-1}, n_i\}$ and $E=\{(n_1,
-n_2), (n_2, n_3), ... (n_{i-1}, n_{i})\}$. A path graph is basically a graph
-that is a single linear path of nodes where every node is connected to the next
-node except for the last one. The last node is the only final node. The
-transitions between two nodes is either a character or a marking. As an example
-we take the entry \texttt{19:00, 2014-11-12 - Foobar} and create the
+$G=(V,n_1,E,n_i)$ where $V=\{n_1, n_2, \cdots, n_{i-1}, n_i\}$ and
+$E=\{(n_1, n_2), (n_2, n_3), \ldots\\ (n_{i-1}, n_{i})\}$. A path graph is basically
+a graph that is a single linear path of nodes where every node is connected to
+the next node except for the last one. The last node is the only final node.
+The transitions between two nodes is either a character or a marking. As an
+example we take the entry \texttt{19:00, 2014-11-12 - Foobar} and create the
corresponding node-lists and it is shown in Figure~\ref{nodelistexample}.
Characters are denoted with single quotes, spaces with an underscore and
markers with angle brackets. Node-lists are the basic elements from which the
\caption{Example non determinism}
\end{figure}
-\subsection{Minimality and non-determinism}
+\subsection{Minimality \& non-determinism}
The Myhill-Nerode theorem~\cite{Hopcroft1979} states that for every number of
graphs accepting the same language there is a single graph with the least
amount of states. Mihov\cite{Mihov1998} has proven that the algorithm for
repositories / bsc-thesis1415.git / blobdiff