next up previous contents
Next: Containers & Cursors Up: Finite Automaton Previous: Finite Automaton   Contents

Example (figure 1)

Figure 1: Example of NFA
\begin{figure}
\begin{center}\epsfxsize =6cm
\epsfbox{fa_example.eps}
\end{center}
\end{figure}
$A$ is a non-deterministic automaton with $\Sigma = \{ a, b, c \}$, $Q =
\{ 1,2,3,4,5 \}$, $I = \{ 1 \}$, $F = \{ 2, 5 \}$ and $\Delta = \{
(1,a,2), (2,b,2), (1,b,3), (3,a,5), (1,b,4), (4,c,5) \}$.
$L(A) = \{ ab^{*}, ba, bc \}$.

Vincent Le Maout 2003-07-08