If we convert any NFA to DFA is that the minimal DFA or the process is NFA -> DFA -> minimize the DFA

Dark Mode

9,352 views

1 vote

# Consturct directly the minimized DFA without using NFA using basic method.

**STEP 1**: First construct skeleton of DFA to accept the smallest/Basic strings of language i.e. {100,101,110,111} . So states {q3,q4,q6,q7} will be our Final-states which accepts above basic strings independently. These 4 states leads to the specific patterns which should be observed in step 2.-
**STEP 2:**To make it valid DFA ,still we need to show the transitions from final sates q3,q4,q6,q7. It is very easy to step the transitions further from these final states by considering strings which passes through these states, on both symbols {0,1} (like we do in DFAs). Keep in mind that every transition from final states will indicate for specificwhich are drawn in step-1. Eg: q3 on 1 should go to q1 ,since on 1001, last 1 may become 3rd 1 from RHS (eg in 100100). hence choose transitions appropriately by observing previous patterns.**pattern****Below is final minimized DFA.**