Deterministic Finite Automata (DFA) Nondeterministic Finite Automata

N
E
E
H
G
F
E
'
D
E
e
E
d
¦
%
F E
C
%
B
'
E F
M
A
%
E
F E
K
C
H M
E
B
D
N
E
Transition diagrams
are a graphical notation for FAs.
A transition diagram for a NFA
1. For each state in
2. if
labelled
there is a node,
is a graph s.t.
then (and only then) there is an arc from
M, (we allow ourselves to collate multiple arcs between the same
nodes into a single one labelled with a list)
3. there is an arrow without source node into the start state,
4. nodes representing accepting states are marked with double
circles.
a,b
to
b
b
a
02140 Languages and Parsing, MF, Fall 2004 – p.19/22
Transition tables
Do now assign sets of states:
' Q
'
E
e
%
E
02140 Languages and Parsing, MF, Fall 2004 – p.20/22