Non Deterministic Automata

Non Deterministic Automata
Nondeterministic Finite Accepter (NFA)
Alphabet = {a}
q1 a q2
a
q0
a
q3
2
Alphabet = {a}
Two choices q1 a q2
a
q0
a
q3
3
Alphabet = {a}
Two choices a
q1 q2 No transition
a
q0
a
q3 No transition
4
First Choice
a a
q1 a q2
a
q0
a
q3
5
First Choice
a a
q1 a q2
a
q0
a
q3
6
First Choice
a a
q1 a q2
a
q0
a
q3
7
First Choice
a a
q1 a q2 “accept”
a
q0
a
q3
8
Second Choice
a a
q1 a q2
a
q0
a
q3
9
Second Choice
a a
q1 a q2
a
q0
a
q3
10
Second Choice
a a
q1 a q2
a
q0
a
No transition:
q3
the automaton hangs
11
Second Choice
a a
q1 a q2
a
q0
a
q3 “reject”
12
Observation
An NFA accepts a string if there is a

computation of the NFA that accepts
the string.
13
Example
aa is accepted by the NFA:
q1 a q2
a
q0
a
q3
14
Epsilon Transitions
q0 a q1  q1 a q3
15
a a
q0 a q1  q2 a q3
16
a a
q0 a q1  q2 a q3
17
(read head doesn’t move)
a a
q0 a q1  q2 a q3
18
a a
q0 a q1  q2 a q3
19
a a
“accept”
q0 a q1  q2 a q3
String aa is accepted
20
Language accepted: L  {aa}
q0 a q1  q2 a q3
21
Another NFA Example
q0 a q1 b q2  q3
22
a b
q0 a q1 b q2  q3
23
a b
q0 a q1 b q2  q3
24
a b
q0 a q1 b q2  q3
25
a b
“accept”
q0 a q1 b q2  q3
26
Another String
a b a b
q0 a q1 b q2  q3
27
a b a b
q0 a q1 b q2  q3
28
a b a b
q0 a q1 b q2  q3

29
a b a b
q0 a q1 b q2  q3
30
a b a b
q0 a q1 b q2  q3
31
a b a b
q0 a q1 b q2  q3
32
a b a b
q0 a q1 b q2  q3
33
a b a b
“accept”
q0 a q1 b q2  q3
34
Language accepted
L  ab, abab, ababab, ...


 ab
q0 a q1 b q2  q3

35
Another NFA Example
0
q0 q1 0, 1 q2
1

36
Language accepted
L  , 10, 1010, 101010, ...

 10*
0
q0 q1 0, 1 q2
1

37
Formal Definition of NFAs
M  Q, ,  , q0 , F 
Q: Set of states, i.e. q0 , q1, q2 

: Input alphabet, i.e. a, b
: Transition function
q0 : Initial state or start state
F: Final states or accepting state

38
Transition Function 
 q0 , 1  q1
0
q0 q1 0, 1 q
2
1

39
 (q1,0)  {q0 , q2}
0
q0 q1 0, 1 q
2
1

40
(q0 ,)  {q0 , q2 }
0
q0 q1 0, 1 q
2
1

41
 (q2 ,1)  
0
q0 q1 0, 1 q
2
1

42

Extended Transition Function 

q0 , a   q1 
q4 q5
a a
q0 a q1 b q2  q3

43

q0 , aa   q 4 , q 5 
q4 q5
a a
q0 a q1 b q2  q3

44

q0 , ab   q 2 , q3 , q0 
q4 q5
a a
q0 a q1 b q2  q3

45
Formally

It holds q j   qi , w
if and only if
there is a walk from qi to q j

with label w
46
The Language of an NFA M
F  q0 ,q5 
q4 q5

a a
q0 a q1 b q2 q3

 

q0 , aa   q4 , q5 aa  L( M )
47
F  q0 ,q5 
q4 q5
a a
q0 a q1 b q2  q3

  ab LM 

q0 , ab  q2 , q3 , q0
48
F  q0 ,q5 
q4 q5
a a
a b 
q0 q1 q2 q3
 

q0 , abaa   q4 , q5 aaba  L( M )
49
F  q0 ,q5 
q4 q5
a a
q0 a q1 b q2  q3


q0 , aba   q1 
aba  LM 
50
q4 q5
a a
q0 a q1 b q2
 q3


LM   aa  ab*  ab aa
51
Formally
The language accepted by NFA is: M
LM   w1, w2 , w3 ,...


where (q0 , wm )  {qi , q j ,...}
and there is some qk  F
(final state)
52
w  LM 

(q0 , w)
qi
w
qk qk  F
q0 w
w qj
53
Equivalence of NFAs and DFAs
Equivalence of Machines
For DFAs or NFAs: M1
Machine M 2 is equivalent to machine
if L M1   L M 2 
55
Example
NFA M1
LM1   {10} * 0
q0 q1 0, 1 q2
1

DFA M2 0,1
LM 2   {10} * 0
q0 q1 1 q2
1
0
56
LM1   LM 2   10*
Since machines M1 and M 2 are equivalent
0
0, 1
NFA M1 q0
1
q1 q2
0,1
0
DFA M2 q0 q1 1 q2
1
0
57
Question: NFAs = DFAs ?
Same power?
Accept the same languages?
58
Question: NFAs = DFAs ? YES!
Same power?
Accept the same languages?
59
We will prove:

Languages Languages
accepted accepted
by NFAs by DFAs
60
We will prove:

Languages Languages
accepted accepted
by NFAs by DFAs
NFAs and DFAs have the same

computation power
61
Step 1
Languages Languages
accepted
by NFAs
 accepted
by DFAs
62
Step 1
Languages Languages
accepted
by NFAs
 accepted
by DFAs
Proof: Every DFA is also an NFA
63
Step 1
Languages Languages
accepted
by NFAs
 accepted
by DFAs
Proof: Every DFA is also an NFA
A language accepted by a DFA

is also accepted by an NFA
64
Step 2
Languages Languages
accepted
by NFAs
 accepted
by DFAs
65
Step 2
Languages Languages
accepted
by NFAs
 accepted
by DFAs
Proof: Any NFA can be converted to an

equivalent DFA
66
Step 2
Languages Languages
accepted
by NFAs
 accepted
by DFAs
Proof: Any NFA can be converted to an

equivalent DFA
A language accepted by an NFA
is also accepted by a DFA
67
NFA to DFA
NFA
a
q0 a q1  q2
b
DFA
a, b
q0 
68
NFA to DFA
NFA
a
q0 a q1  q2
b
DFA
q0  a
q1,q2
b
69
NFA to DFA
NFA
a
q0 a q1  q2
b
a
DFA
q0  a
q1,q2
b

70
NFA to DFA
NFA
a
q0 a q1  q2
b
a
DFA
q0  a
q1,q2
b

71
NFA to DFA
NFA
a
q0 a q1  q2
b
b a
DFA
q0  a
q1,q2
b

72
NFA to DFA
NFA
a
q0 a q1  q2
b
b a
DFA
q0  a
q1,q2
b
a, b

73
NFA to DFA
NFA
a
q0 a q1  q2
b
a
DFA b
q0  a
q1,q2
b
a, b

74
NFA to DFA: Remarks
We are given an NFA M
We want to convert it M  to an equivalent DFA
With LM   L(M )
75
If the NFA has states q0 , q1, q2 ,...
the DFA has states in the power set
, q0 , q1, q1, q2 , q3 , q4 , q7 ,....
76
Procedure NFA to DFA
1. Initial state of NFA: q0
Initial state of DFA: q0 

77
Example
NFA
a
q0 a q1  q2
b
DFA
q0 
78
2. For every DFA’s state {qi , q j ,..., qm }
Compute in the NFA

q i , a ,
 {qi , qj ,..., qm
}
q j , a ,

Add transition
...
 {qi , q j ,..., qm }, a   {qi , qj ,..., qm

}
79
Example
NFA
a
q0 a q1  q2

b
(q0 , a)  {q1 , q 2 }
DFA
q0  a
q1,q2
 q0 , a   q1, q2 
80
Repeat Step 2 for all letters in alphabet,

until
no more transitions can be added.
81
Example
NFA
a
q0 a q1  q2
b
b a
DFA
q0  a
q1,q2
b
 a, b
82
3. For any DFA state {qi , q j ,..., qm }
If someq j is a final state in the NFA
Then, {qi , q j ,..., qm }

is a final state in the DFA
83
Example
NFA
a
q0 a q1  q q1  F
2
b
a
DFA b
q0  a
q1,q2 q1, q2  F 
b
 a, b
84
Theorem
Take NFA M
Apply procedure to obtain DFA M
Then M and M  are equivalent :
L M   L M  
85
Finally
We have proven

Languages Languages
accepted accepted
by NFAs by DFAs
86
We have proven

Languages Languages
accepted accepted
by NFAs by DFAs
Regular Languages
87
We have proven

Languages Languages
accepted accepted
by NFAs by DFAs
Regular Languages Regular Languages
88

Non Deterministic Automata

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Non Deterministic Automata

Hochgeladen von

Copyright:

Verfügbare Formate

Non Deterministic Automata

Nondeterministic Finite Accepter (NFA)

An NFA accepts a string if there is a

aa is accepted by the NFA:

L  ab, abab, ababab, ...

L  , 10, 1010, 101010, ...

Q: Set of states, i.e. q0 , q1, q2 

q0 : Initial state or start state

F: Final states or accepting state

there is a walk from qi to q j

LM   w1, w2 , w3 ,...

and there is some qk  F

For DFAs or NFAs: M1

Machine M 2 is equivalent to machine

Question: NFAs = DFAs ?

Question: NFAs = DFAs ? YES!

NFAs and DFAs have the same

Proof: Every DFA is also an NFA

Proof: Every DFA is also an NFA

A language accepted by a DFA

Proof: Any NFA can be converted to an

Proof: Any NFA can be converted to an

We are given an NFA M

We want to convert it M  to an equivalent DFA

With LM   L(M )

the DFA has states in the power set

, q0 , q1, q1, q2 , q3 , q4 , q7 ,....

1. Initial state of NFA: q0

Initial state of DFA: q0 

 {qi , q j ,..., qm }, a   {qi , qj ,..., qm

Repeat Step 2 for all letters in alphabet,

3. For any DFA state {qi , q j ,..., qm }

If someq j is a final state in the NFA

Then, {qi , q j ,..., qm }

Apply procedure to obtain DFA M

Then M and M  are equivalent :

Regular Languages Regular Languages

Das könnte Ihnen auch gefallen