Conversion of NFA to DFA (Example 1)
Conversion of NFA to DFA (Example 2)
Conti…
Conversion of NFA to DFA (Example 3)
Conversion of NFA to DFA (Example 4)
Conti…
Minimization of Finite automata
 Steps to minimize state of DFA’s
• Steps
1. Remove from the diagram any unreachable state from starting state.
2. Construct state transition table from the diagram.
3. Group the states in to final and non final.
4. Group every element of the previous group in the same group if pair of
the element of the previous group remain the same group on reading
each symbol of the input alphabet.
5. Repeat step four until you get the same elements on preceding grouping
and current grouping.
Conti…
Minimization of DFA (Example 1)
Conti…
Minimization of DFA (Example 2)
Conti…
Minimization of DFA (With Multiple Final
States)
Conti…
Minimization of DFA (With Unreachable
States)
Conti…
Conti…