Deterministic Finite Automata (DFA) Nondeterministic Finite Automata

Determismistic & Nondeterministic
Finite Automata
Martin Fränzle
Informatics and Mathematical Modelling
The Technical University of Denmark
02140 Languages and Parsing, MF, Fall 2004 – p.1/22
Preliminaries for Formal Languages:
Alphabets, strings, languages
02140 Languages and Parsing, MF, Fall 2004 – p.2/22

£
¤
£ ¢
¡
£
What you’ll learn
You will be introduced to the basic notions of
Alphabet: A set of “symbols”,
String/word: a sequence of symbols from the alphabet,
Language: a set of strings.
02140 Languages and Parsing, MF, Fall 2004 – p.3/22
Alphabets
Def.: An alphabet is a finite, nonempty set.
Ex.:
The binary alphabet ¥,
the set of all printable ASCII characters,
the set
¡red
£green £blue
yellow £magenta cyan
¥of basic colors.
N.B.: This notion of alphabet is distinctly different from everyday use:
alphabets need not feature an ordering,
the members of an alphabet need not be letters in the usual
sense, but can well be compounds of some kind (e.g.,
tuples).
We will often denote alphabets by the greek letter
¦.
02140 Languages and Parsing, MF, Fall 2004 – p.4/22

§
§
§
£
¦
¡
§
¨
¢
£
¤
©
§
§
¢
¤
¢
£ ¢
£ ¢
¢ £
¤ ¢
©
¡
£
¥
§
§
§
¦
¦
'
¦
!
&
%
¦
§
¦
¦
¦
'
¦
&
%
$
¦
¦
¦
Strings (a.k.a. words)
Def.: A string (or word) over an Alphabet
symbols from ¦.
Ex.:
The length of a string §, denoted
for symbols in the string.
is a finite sequence of
¨, is the number of positions
(or, more formally, ) is a string of length 4 over alphabet
¥.
is the string of length 0 over alphabet (as well as over any
other alphabet). It is called the empty string and is generically denoted
, irrespective of the particular alphabet.
Def.: Given strings
the concatenation of
of length
.
def
and
and
is the string
,
02140 Languages and Parsing, MF, Fall 2004 – p.5/22
Powers of an alphabet
Given an alphabet
over
and a natural number
is the set of all strings over
def
def
¦,
"!
#
of length
N,
,
is the set of all nonempty strings
is the set of all strings over
¦.
02140 Languages and Parsing, MF, Fall 2004 – p.6/22

* 5
¥
¡
6
¥
¦
)
(
§
,
3
+
=
¤
¥ <
(
+
3
£
¢
¡
¥
*
¥
¤
¡
¡
¥
£
3 ¥
£
£ 1
£
)
)
¤
¤ ¡
£
£ ¢
;
£ /
¥ :
¤
¤
¤
¦
7
7
¤
£
£
¤
¤ ¢
¤
¢
£ 1
¢
£ 9
¢ £
¢
¡
¢
¤ £
¡
£
¢
£ ¢
¤
(
¥ -
£ 0
¡
£
;
£ /
£ .
¤
¥ <
¤ ¢
¡
£
-
£
¤
£
£
6
¤ ¢
¤ ¡
¢
;
£ ¢
£
¡
§
¤ ¢
¥ :
£
¡
£ 9
¡
8
)
)
¥
3
7
(
4
2
¡
Languages
Def.: A set of strings over an alphabet
called a language over ¦.
Ex.:
The set of strings consisting of
N forms a language over
The set of strings over
language over
is a language over
is a language (over arbitrary alphabet),
¥:
2,
(i.e., a subset of
0’s followed by
¥:
$) is
1’s for arbitrary
representing a prime number forms a
is a language (over arbitrary alphabet).
Note:
Note: Languages can be finite or infinite!
N
4.
02140 Languages and Parsing, MF, Fall 2004 – p.7/22
Problems
Def.: Given a language over some alphabet ¦, the problem
Given a string over ¦, decide whether or not 6.
Ex.:
Problem of deciding whether some
representation of a prime number.
Problem of deciding whether some
english verb.
Problem of deciding whether a string
is a binary
is:
is the imperfect of an
describes
a game of chess where ‘white’ has won,
a game of chess that has reached a position where ‘white’ can
enforce a win.
Questions concerning a given problem are in particular
whether it can be solved by a computer,
if so, what would be the best algorithm to do so,
how much computational effort this requires.
02140 Languages and Parsing, MF, Fall 2004 – p.8/22

@
£
£ ?
?
£
?
£
? £
£
¡
¡
¥
¥
?
?
?
£ ?
?
£ ?
?
?
£ ?
?
>
Finite Automata
The deterministic variant: DFAs
02140 Languages and Parsing, MF, Fall 2004 – p.9/22
DFAs — informally
An automaton is a computational device that changes its state depending
on the inputs it receives.
A finite automaton has finitely many states for remembering its computation
history.
In a deterministic finite automaton, the current state is completely
determined by the sequence of inputs seen so far.
Automata define languages through the following mechanism:
1. Some states are marked as being “accepting”;
2. whenever the automaton is in an accepting state, the string of inputs
seen so far is a member of the language accepted by the automaton.
a
b
a
b
a
a
b
b
a,b
02140 Languages and Parsing, MF, Fall 2004 – p.10/22

N
E
E
H
G
F
E
D
H
¦
G
F
C
E
B
D
H M
¦
A
L
E
E
C
G
B
D
K
B
¦
A
J
C
F
E
E
I
D
C
F
E
N
E
E
H M
E
B
D
DFAs — formally
A deterministic finite automaton (DFA)
1. a finite set of states C,
2. a finite set of input symbols ¦, called the “alphabet of
3. a transition function
4. a start state C,
5. a set of final or accepting states
C,
C.
consist of
A”,
The automaton
1. starts in
2. proceeds from state
F,
to state
if the current input is M,
3. accepts a string ( sequence of symbols) iff that sequence of
inputs drives it from to some G.
02140 Languages and Parsing, MF, Fall 2004 – p.11/22
Transition diagrams
are a graphical notation for FAs.
A transition diagram for a DFA
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.
to
a
b
a
b
a
a
b
b
a,b
02140 Languages and Parsing, MF, Fall 2004 – p.12/22

M
C
¦
K
H
S
$
¦
B
J
H
C
E
S
I
H M
R
D
E
E
E
B
E
P
D
B
R
D
H M
E
E
E
O
H
H
E
S
E
F E
Y
T
E
M
W
V
K
U
E
E
B
R
D
D B
T
B
D
E
K
H M
H
S
&
¦
E
E
J
B
B
R
D
R
D
C
I
D
Transition tables
are tabular representations of transition functions, where information
about initiality and finality of states is added:
F Q
As the state space and the alphabet can be deduced from the
table, transition tables are a complete representation of DFAs!
02140 Languages and Parsing, MF, Fall 2004 – p.13/22
Extending the trans. fct. to strings
Given
recursion:
Base case:
Recursion:
def
def
C, we define a function
for each
Recursion
C;
for each
R
S V U X
W
C,
$,
via
¦.
N.B.:
We could as well have defined
def
without altering the function defined.
02140 Languages and Parsing, MF, Fall 2004 – p.14/22

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

H G
F
E
D
¦
C
B
A
=
)
]
K
¦
J
D
C
J
C
_
a £
L
¦
B
8
b
G
J
C
^
N
a
I
D
`
_
¡
*
F
E
`
_
NFAs — informally
Has the freedom to do various different moves when in a state
and seeing some input,
has the help of an “oracle” for performing the right guess,
this is modeled mathematically as
1. the ability to be in various states at once, and
2. accepting a string whenever at least one of those states is
accepting.
a,b
b
b
a
02140 Languages and Parsing, MF, Fall 2004 – p.17/22
NFAs — formally
An nondeterministic finite automaton (NFA)
consist of
1. a finite set of states C,
2. a finite set of input symbols ¦, called the “alphabet of
3. a transition function
with a transition relation
4. a start state C,
5. a set of final or accepting states
The automaton
1. starts in state set
2. proceeds from state set
¥,
to state set
A”,
H, (which may be identified
C),
C.
if the current input is ,
3. accepts a string ( sequence of symbols) iff that sequence of inputs drives
it from to a state set containing some c.
02140 Languages and Parsing, MF, Fall 2004 – p.18/22

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

H
C
B
]
M
K
¦
A
H
$
¦
H
B
S
G
J
\
F
C
e
E
D
q
I
R
D
E
p
H
l k
nm
j hi
C
'
o
E
E
B
]
K
¦
E
E
J
B
B
M
B
D
g
f
A
B
§
B
¦
G
C
H
F
A
E
B
R
D
[[
$
¦
§
Z
H
A
H
H
A
S
H &
%
B
6
B
6
6
H M
R
D
R
D
C
I
D
Extending the trans. fct. to strings
Given
via recursion:
Base case:
Recursion:
def
def
H, we define a function
for each
C;
for each
C,
$,
¦.
02140 Languages and Parsing, MF, Fall 2004 – p.21/22
The language of an NFA
Def: The language
def
of a an NFA
is
The language thus is the set of strings that drive from the
initial state to a set of states containing some accepting state.
02140 Languages and Parsing, MF, Fall 2004 – p.22/22