non-deterministic automata regular expressions
DESCRIPTION
Non-Deterministic Automata Regular Expressions. NFA Example. NFA Example. Input aplhabet, i.e. Formal Definition of NFAs. Set of states, i.e. Transition function. Initial state. Final states. Transition Function. Extended Transition Function. Formally. It holds. if and only if. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/1.jpg)
1
Non-Deterministic Automata
Regular Expressions
![Page 2: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/2.jpg)
2
NFA Example
0q 1q 2q
0
11,0
*10
...,101010,1010,10,
L
![Page 3: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/3.jpg)
3
NFA Example
0q 1q 2qa b
3q
ab
abababababL ...,,,
![Page 4: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/4.jpg)
4
Formal Definition of NFAs FqQM ,,,, 0
:Q
:
:0q
:F
Set of states, i.e. 210 ,, qqq
: Input aplhabet, i.e. ba,Transition function
Initial state
Final states
![Page 5: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/5.jpg)
5
Transition Function
0q 1q 2q
0
11,0
200
0
10
,,
0,
1,
qqq
q
1,
,0,
2
201
q
qqq
![Page 6: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/6.jpg)
6
Extended Transition Function
*
0q
5q4q
3q2q1qa
aa
b
0320
540
10
,,,*
,,*
,*
qqqabq
qqaaq
qaq
![Page 7: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/7.jpg)
7
Formally
wqq ij ,*
It holds
if and only if
there is a walk from towith label
iq jqw
![Page 8: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/8.jpg)
8
The Language of an NFA
0q
5q4q
3q2q1qa
aa
b
0320
540
,,,*
,,*
qqqabq
qqaaq
M
MLab
MLaa
)(
50 ,qqF
![Page 9: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/9.jpg)
9
0q
5q4q
3q2q1qa
aa
b
50 ,qqF
10
540
,*
,,*
qabaq
qqabaaq
MLaba
MLaaba
)(
![Page 10: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/10.jpg)
10
0q
5q4q
3q2q1qa
aa
b
aaababaaML *
![Page 11: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/11.jpg)
11
FormallyThe languageaccepted by NFA is:
where
and there is some
)(MLM
,...,, 321 wwwML
,...,),(* 0 ji qqwq
Fqk (final state)
![Page 12: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/12.jpg)
12
0q kq
w
w
w
),(* 0 wq MLw
Fqk
iq
jq
![Page 13: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/13.jpg)
13
Equivalence of NFAs and DFAs
For DFAs or NFAs:
Machine is equivalent to
if
1M 2M
21 MLML
![Page 14: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/14.jpg)
14
Example
0q 1q 2q
0
11,0
0q 1q 2q
0
11
0
1,0
NFA
DFA
*}10{1 ML
*}10{2 ML
![Page 15: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/15.jpg)
15
Since
machines and are equivalent
*1021 MLML
1M 2M
0q 1q 2q
0
11,0
0q 1q 2q
0
11
0
1,0
DFA
NFA 1M
2M
![Page 16: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/16.jpg)
16
Equivalence of NFAs and DFAs
Every DFA is also an NFA
A language accepted by a DFA will be accepted by an NFA
An NFA is as least as powerful as a DFA
Is an DFA as powerful as an NFA?
![Page 17: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/17.jpg)
17
Is a DFA as Powerful as an NFA?
Answer: YES!
A language accepted by an NFA will be accepted by some DFA
For every NFA there is an equivalent DFAthat accepts the same language
![Page 18: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/18.jpg)
18
NFAs Accept the Regular Languages
For every NFA there is an equivalent DFA
The language accepted by a DFA is regular
The language accepted by an NFA is regular
![Page 19: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/19.jpg)
19
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q
![Page 20: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/20.jpg)
20
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
![Page 21: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/21.jpg)
21
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
![Page 22: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/22.jpg)
22
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
a
![Page 23: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/23.jpg)
23
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
ab
![Page 24: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/24.jpg)
24
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
ab
![Page 25: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/25.jpg)
25
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
ab
ba,
![Page 26: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/26.jpg)
26
NFA to DFA
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
ab
ba,
![Page 27: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/27.jpg)
27
NFA to DFA Observations
We are given an NFA
We want to convert it to an equivalent DFA
With
M
M
)(MLML
![Page 28: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/28.jpg)
28
If the NFA has states
The DFA has states in the powerset
,...,, 210 qqq
,....,,,,,,, 7432110 qqqqqqq
![Page 29: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/29.jpg)
29
Procedure NFA to DFA
1. Initial state of NFA:
Initial state of DFA:
0q
0q
![Page 30: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/30.jpg)
30
Example
a
b
a
0q 1q 2q
NFA
DFA
0q
![Page 31: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/31.jpg)
31
Procedure NFA to DFA 2. For every DFA’s state
Compute in the NFA
Giving union
Add a transition
mji qqq ,...,,
...,,*
,,*
aq
aq
j
i
mji qqq ,...,,
mjimji qqqaqqq ,...,,,,...,,
![Page 32: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/32.jpg)
32
Exampe
a
b
a
0q 1q 2q
NFA
0q 21,qqa
DFA
},{),(* 210 qqaq
210 ,, qqaq
![Page 33: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/33.jpg)
33
Procedure NFA to DFA
Repeat Step 2 for all letters, untilno more transitions can be added.
![Page 34: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/34.jpg)
34
Example
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
ab
ba,
![Page 35: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/35.jpg)
35
Procedure NFA to DFA 3. For any DFA state
If some is a final state for the NFA
Then, is a final state for the DFA
mji qqq ,...,,
jq
mji qqq ,...,,
![Page 36: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/36.jpg)
36
Example
a
b
a
0q 1q 2q
NFA
DFA
0q 21,qqa
b
ab
ba,
Fq 1
Fqq 21,
![Page 37: Non-Deterministic Automata Regular Expressions](https://reader035.vdocuments.us/reader035/viewer/2022062217/568148f7550346895db61b6f/html5/thumbnails/37.jpg)
37
Theorem Take NFA M
Apply procedure to obtain DFA M
Then and are equivalent :M M
MLML