Home > Minimization Of DFA

### Conversion Of NFA To DFA

Conversion Of NFA To DFA Construct The DFA For The Following NFA Solution:- DFA TRANSITION TABLE AFTER MERGING SAME STATES TO ONE STATE, I'LL DELETE ONE OF THESE STATES If You Observe Given NFA The String Is Containing ab As Substring. In This D FA Also The String Contains ab As Substring.   Every State In This Given

### DFA Example : Minimization Of DFA Example 3

Minimization Of DFA Example 3   Solution:- Step 1- Delete Unreachable State From (q0) q4,q5,q6,q7 Are Unreachable Because If You Observe From q3. q4,q5,q6,q7  Are Outward Arrows To q3. There Is No Inward Arrow Which Is Going From q3.   Delete q4,q5,q6,q7 Step 2:- Transition Table  Step 3 - State Equivalence Method 0-Equivalence - [q0,q1,q2][q3] 1-Equivalence- [q0,q1][q2][q3] 2-Equivalence- [q0][q1][q2][q3]

### DFA Example : Minimization Of DFA Example 2

Minimization Of DFA Example 2 Solution:- Step 1- Delete Unreachable States From Start State(q0) If You Observe q3, It Has Outward Arrows, I Can't Reach q3, From q1, So I'm Deleting q3 Step 2:- Transition Table   Step 3:- State Equivalence Method 0-Equivalence [q0][q1,q2]  // q0  Is Non-Final State, q1,q2 Are Final States. 1-Equivalence [q0][q1,q2] 0-Equivalence & 1-Equivalence Are Same I'll Stop Here. I'll Merge q1,q2 Because Both