# Minimization of DFA

DFA minimization stands for converting a given DFA to its equivalent DFA with minimum number of states.

**Minimization of DFA**

Suppose there is a DFA D < Q, Σ, q0, δ, F > which recognizes a language L. Then the minimized DFA D < Q’, Σ, q0, δ’, F’ > can be constructed for language L as:

**Step 1:** We will divide Q (set of states) into two sets. One set will contain all final states and other set will contain non-final states. This partition is called P_{0}.

**Step 2:** Initialize k = 1

**Step 3:** Find P_{k} by partitioning the different sets of P_{k-1}. In each set of P_{k-1}, we will take all possible pair of states. If two states of a set are distinguishable, we will split the sets into different sets in P_{k}.

**Step 4:** Stop when P_{k} = P_{k-1} (No change in partition)

**Step 5:** All states of one set are merged into one. No. of states in minimized DFA will be equal to no. of sets in P_{k}.

**How to find whether two states in partition P _{k} are distinguishable ?**

Two states ( qi, qj ) are distinguishable in partition P

_{k}if for any input symbol a, δ ( qi, a ) and δ ( qj, a ) are in different sets in partition P

_{k-1}.

**Example**

Consider the following DFA shown in figure.

**Step 1.**P0 will have two sets of states. One set will contain q1, q2, q4 which are final states of DFA and another set will contain remaining states. So P0 = { { q1, q2, q4 }, { q0, q3, q5 } }.

**Step 2.**To calculate P1, we will check whether sets of partition P0 can be partitioned or not:

**i) For set { q1, q2, q4 } :**

δ ( q1, 0 ) = δ ( q2, 0 ) = q2 and δ ( q1, 1 ) = δ ( q2, 1 ) = q5, So q1 and q2 are not distinguishable.

Similarly, δ ( q1, 0 ) = δ ( q4, 0 ) = q2 and δ ( q1, 1 ) = δ ( q4, 1 ) = q5, So q1 and q4 are not distinguishable.

Since, q1 and q2 are not distinguishable and q1 and q4 are also not distinguishable, So q2 and q4 are not distinguishable. So, { q1, q2, q4 } set will not be partitioned in P1.

**ii) For set { q0, q3, q5 } :**

δ ( q0, 0 ) = q3 and δ ( q3, 0 ) = q0

δ ( q0, 1) = q1 and δ( q3, 1 ) = q4

Moves of q0 and q3 on input symbol 0 are q3 and q0 respectively which are in same set in partition P0. Similarly, Moves of q0 and q3 on input symbol 1 are q3 and q0 which are in same set in partition P0. So, q0 and q3 are not distinguishable.

δ ( q0, 0 ) = q3 and δ ( q5, 0 ) = q5 and δ ( q0, 1 ) = q1 and δ ( q5, 1 ) = q5

Moves of q0 and q5 on input symbol 1 are q3 and q5 respectively which are in different set in partition P0. So, q0 and q5 are distinguishable. So, set { q0, q3, q5 } will be partitioned into { q0, q3 } and { q5 }. So,

P1 = { { q1, q2, q4 }, { q0, q3}, { q5 } }

To calculate P2, we will check whether sets of partition P1 can be partitioned or not:

**iii)For set { q1, q2, q4 } :**

δ ( q1, 0 ) = δ ( q2, 0 ) = q2 and δ ( q1, 1 ) = δ ( q2, 1 ) = q5, So q1 and q2 are not distinguishable.

Similarly, δ ( q1, 0 ) = δ ( q4, 0 ) = q2 and δ ( q1, 1 ) = δ ( q4, 1 ) = q5, So q1 and q4 are not distinguishable.

Since, q1 and q2 are not distinguishable and q1 and q4 are also not distinguishable, So q2 and q4 are not distinguishable. So, { q1, q2, q4 } set will not be partitioned in P2.

**iv)For set { q0, q3 } :**

δ ( q0, 0 ) = q3 and δ ( q3, 0 ) = q0

δ ( q0, 1 ) = q1 and δ ( q3, 1 ) = q4

Moves of q0 and q3 on input symbol 0 are q3 and q0 respectively which are in same set in partition P1. Similarly, Moves of q0 and q3 on input symbol 1 are q3 and q0 which are in same set in partition P1. So, q0 and q3 are not distinguishable.

**v) For set { q5 }:**

Since we have only one state in this set, it can’t be further partitioned. So,

P2 = { { q1, q2, q4 }, { q0, q3 }, { q5 } }

Since, P1=P2. So, this is the final partition. Partition P2 means that q1, q2 and q4 states are merged into one. Similarly, q0 and q3 are merged into one. Minimized DFA corresponding to DFA of Figure 1 is shown in Figure 2 as:

**Question :** Consider the given DFA. Which of the following is false?

1. Complement of L(A) is context-free.

2. L(A) = L ( ( 11 * 0 + 0 ) ( 0 + 1 )* 0* 1* )

3. For the language accepted by A, A is the minimal DFA.

4. A accepts all strings over { 0, 1 } of length atleast two.

A. 1 and 3 only

B. 2 and 4 only

C. 2 and 3 only

D. 3 and 4 only

**Solution :** Statement 4 says, it will accept all strings of length atleast 2. But it accepts 0 which is of length 1. So, 4 is false.

Statement 3 says that the DFA is minimal. We will check using the algorithm discussed above.

P0 = { { q2 }, { q0, q1 } }

P1 = { q2 }, { q0, q1 } }. Since, P0 = P1, P1 is the final DFA. q0 and q1 can be merged. So minimal DFA will have two states. Therefore, statement 3 is also false.

So correct option is (D).

This article has been contributed by Sonal Tuteja.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

## Recommended Posts:

- Polytime Manyone reduction: Clique to E-TM
- DFA that begins with 'a' but does not contain substring 'aab'
- Intersection process of two DFAs
- Post Correspondence Problem
- Design a DFA that accepts a string containing 3 a's and 3 b's
- Build a DFA to accept a binary string containing "01" i times and "1" 2j times
- CYK Algorithm for Context Free Grammar
- Proof that Path Selection Decision problem is NP-Complete
- Build a DFA to accept Binary strings that starts or ends with "01"
- Construct a Turing Machine for language L = {a^n b^m c^nm where n >=0 and m >= 0}
- Construct a Turing Machine for language L = {0
^{2n}1^{n}| n>=0} - DFA for exactly one of a and at least one of b
- Church’s Thesis for Turing Machine
- Difference between DFA and NFA