Professional Documents
Culture Documents
kr chowdhary TOC 1/ 13
Introduction
kr chowdhary TOC 2/ 13
Some definitions
kr chowdhary TOC 3/ 13
Minimization Example
q0
0
q2 q4
1 and the state which remains
0 q6
will have in addition, all
1
1 0 1 0
0
incoming transitions from the
q1
1
q3
1
q5
removed state.
0,1
Similarly, the states q0 , q4 are
Finite automata to be minimized
also indistinguishable states,
hence they can also be
q6 has no role, hence it can be
merged. q3 is dead state.
removed.
q1 , q5 are indistinguishable
states because their behavior 0
kr chowdhary TOC 4/ 13
Formalism for minimization
kr chowdhary TOC 5/ 13
Formalism for minimization
kr chowdhary TOC 6/ 13
Minimization Example#1
0
0 q1 1
0, 1
q0
q3
1
1
Finite q2
Automata
0
0 0, 1
0, 1 1
[s0] [s1] [s2]
Minimized FA
Proof.
If p , q are distinguishable by wa then p, q are distinguishable by string
w.
kr chowdhary TOC 8/ 13
Minimization Algorithm(Table Filling Algorithm)
kr chowdhary TOC 9/ 13
Implementation of Table Filling Algorithm
Steps:
1 Let M = (Q, , , s, F ). Remove all the non-reachable states.
2 For p F and q Q F , put x in table at (p, q). This shows that
p, q are distinguishable.
3 If w , such that (p, w ) F and (q, w )
/ F , mark (p, q) as
distinguishable.
4 Recursion rule: if (p, w ) = r , (q, w ) = s, and (r , s) were earlier
proved distinguishable, then mark (p, q) also distinguishable in the
table.
0
1
0 1 0
q0 q1 q2 q3
1 1
0 0 1
1 1 0
q4 q5 q6
q7
1 0
q1 x
q2 x x
q4 x x
q5 x x x x
q6 x x x x
x
q7 x x x x
q0 q1 q2 q4 q5 q6
1
0 1
{q0, q4} {q1, q7} {q2}
1
0 0
1 1
{q5} 0
{q6}
Only states pairs which are not marked distinguishable are {q0 , q4 }
and {q1 , q7 }. The automata shown in figure above is reduced
automata.