Deterministic Finite Automata (DFA) Nondeterministic Finite Automata

A
H G
F
\
E
G
H
D
A
6
B
C
B
[[
A
A
H
§
A
6
B
¦
6
H
F
6
E
B
R
D
$
¦
A
§
Z
H
H
A
B
B
6
6
H
A
B
6
6
The language of a DFA
Def: The language
of a a DFA
def
is
Def: If
The language thus is the set of strings that drive
the initial state to some accepting state.
from
for some DFA then we call a regular language.
The regular languages are exactly those languages 6which are
definable by DFAs in the sense that for some DFA A.
02140 Languages and Parsing, MF, Fall 2004 – p.15/22
Finite Automata
The nondeterministic variant: NFAs
02140 Languages and Parsing, MF, Fall 2004 – p.16/22