Scribd
Upload
55 views

L10-DFA Minimization

This document summarizes the steps to minimize a deterministic finite automaton (DFA). It begins with an example DFA with 8 states. The steps outlined are: 1) Initialize a table with state pairs marked as unmarked and empty lists, 2) Mark final and non-final state pairs, 3) For each unmarked pair and input symbol, determine the target state, 4) Combine pairs of states that have the same behavior for all inputs, and 5) Delete any unreachable states. The example DFA is then minimized to a 4 state automaton.

Uploaded by

Sanket Khaire
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
55 views

L10-DFA Minimization

This document summarizes the steps to minimize a deterministic finite automaton (DFA). It begins with an example DFA with 8 states. The steps outlined are: 1) Initialize a table with state pairs marked as unmarked and empty lists, 2) Mark final and non-final state pairs, 3) For each unmarked pair and input symbol, determine the target state, 4) Combine pairs of states that have the same behavior for all inputs, and 5) Delete any unreachable states. The example DFA is then minimized to a 4 state automaton.

Uploaded by

Sanket Khaire
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

L9- ToC

DFA Minimization

Course Instructors:
Div 1: Praveen Pawar (Div 1)
Div 2: Jibi Abraham (Div 2)

1
Example-2
 Minimize DFA

2
Example-2
0 1

0 1 0
a b c d b
1 0 1
0 1
1 1 0
e f g h c
1 0

0
d

e
1. Initialize table entries:
Unmarked, empty list f

a b c d e f g
3
Example - 2
0 1

0 1 0
a b c d b
1 0 1
0 1
1 1 0
e f g h c
1 0

0
d

e
2. Mark pairs of final and
non-final states f

a b c d e f g
4
Example - 2
d(b,0)  ? d(a,0) = ?
1
0 d(b,1)  ? d(a,1) = ?
0 1 0
a b c d State (g, b) marked?
0 1 b
1 State (c, f) marked?
0 1
1 1 0
e f g h c
1 0

0
d

e
3. For each unmarked
pair and symbol, … f

a b c d e f g
5
Example – 2
0 1

0 1 0
a b c d b
1 0 1
0 1
1 1 0
e f g h c
1 0

0
d

e
4. Combine unmarked
pairs of states. f
0 1

0 1 g
ae ae bh c
1 0
bh 0
df 1 h
1 df g
0 a b c d e f g
6
Example - 2
0 1

0 1 0
a b c d
1 0 1
0 1
1 1 0
e f g h
1 0

5. Delete unreachable states: None

0 1

0 1
ae bh c
1 0
0
1
1 df g
0
7
Example 3
 Minimize DFA

8
Example 3
 Solution

9
?
10

You might also like