# HG changeset patch
# User Eugen Sawin <sawine@me73.com>
# Date 1310750152 -7200
# Node ID f0aa3c9c2e6537346ced4726e89fa3aa732c7d91
# Parent  1aaea9783e88e145c86ae412a6f2c0b7126cb0ac
Example automaton graph.

diff -r 1aaea9783e88 -r f0aa3c9c2e65 paper/src/paper.tex
--- a/paper/src/paper.tex	Fri Jul 15 18:22:30 2011 +0200
+++ b/paper/src/paper.tex	Fri Jul 15 19:15:52 2011 +0200
@@ -184,20 +184,28 @@
 Given all legal computations of an automaton, we have defined the acceptance condition. A computation is accepting, if it passes through an accepting state infinitely times. Since the set of states $S$ is finite, there must be a state $s \in S$, which occurs infinitely often within an infinite run; but it is not necessary, that $s$ is an accepting state; notice that $F$ can be an empty set.
 
 \subsection{Example}
-Let $\A_1 = (\Sigma, S, S_0, \Delta, F)$ be an automaton.
+Let $\A_1 = (\Sigma, S, S_0, \Delta, F)$ be an automaton with $\Sigma = \{a, b\}$, $S = \{q_0, q_1, q_2\},$ $S_0 = \{q_0\}$ and $\Delta = \{\}, F = \{q_2\}$.
 
-\begin{tikzpicture}[shorten >=1pt,node distance=2cm,auto]
-\draw[help lines] (0,0) grid (3,2);
-\node[state,initial] (q_0) {$q_0$};
+\begin{tikzpicture}[shorten >=0pt, node distance=2cm, auto, semithick, >=stealth
+    %every state/.style={fill, draw=none, gray, text=white},
+    ,accepting/.style={fill, gray!50!black, text=white}
+    %initial/.style ={gray, text=white}]%,  thick]
+    ]
+%\draw[help lines] (0,0) grid (3,2);
+\node[state,initial, initial text=] (q_0) {$q_0$};
 \node[state] (q_1) [above right of= q_0] {$q_1$};
 \node[state] (q_2) [below right of= q_0] {$q_2$};
 \node[state,accepting](q_3) [below right of= q_1] {$q_3$};
-\path[->] (q_0) edge node {0} (q_1)
-edge node [swap] {1} (q_2)
-(q_1) edge node {1} (q_3)
-edge [loop above] node {0} ()
-(q_2) edge node [swap] {0} (q_3)
-edge [loop below] node {1} ();
+\path[->] 
+(q_0) edge node {$a$} (q_1)
+  edge node [swap] {$b$} (q_2)
+(q_1) edge node {$b$} (q_3)
+  edge [loop above] node {$a$} ()
+(q_2) edge node [swap] {$a$} (q_1)
+  edge [loop below] node {$b$} ()
+(q_3) %edge node {$a$} (q_1)
+  edge node {$b$} (q_2);
+\draw[->] (q_3) .. controls +(up:1cm) and +(right:1cm) .. node[above] {$a$} (q_1);
 \end{tikzpicture}
 
 \subsection{Generalised B\"uchi automata}