Home > Theory Of Computation > Conversion Of NFA To 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 NFA And This D FA Contains Two Transitions Of a & b.

 

Example 2:-

Construct The DFA For The Following NFA.

Solution:-

REMEMBER:-

  • In The Place Of Φ, I Have Put ‘qd‘, Because We Cannot Put Φ In D FA, Φ Will Not Come In D FA.
  • qd Is The State We Created. The 0 & 1 Of qGoes To qOnly.

 

 

 

One thought on “Conversion Of NFA To DFA

Leave a Reply