--- /dev/null
+digraph finite_state_machine {
+ node [shape = doublecircle]; 2
+ node [shape = circle]; 0 1
+ 0 -> 1 [label = "a"];
+ 1 -> 2 [label = "b"];
+ 0 -> 2 [label = "c"];j
+}
-\section{Regular expressions, finite state machines and automata}
+\section{Directed acyclic graphs and finitie automata}
+Directed acyclic graphs(DAG) and finite state automatas(FSA) have a lot in
+common concerning pattern recognition and information extraction. By feeding
+words into an algorithm a DAG can be generated so that it matches certain
+patters present in the given words.
\section{Algorithm}