- Keep In Mind
(1) There should be one Stuck/Dead State.
(2) Stuck/Dead State should have self loop.(For all alphabets)
(3) Final/Acceptance State should have self loop.(For all alphabets)
(1) Find out Minimum Length Stringin Language. (e.g 011).
(2) Draw Minimum Length + 1number of states.
(3) Mark First state as Initial State. (4) Mark Last state as Final/Acceptance State. (5) Draw Transition for Minimum Length String.(011)
(6) Draw Self Loop for Final State.
(7) Draw one Isolated State with Self Loop. (Stuck/Dead State)
(8) All Remaining Transition attach to Stuck/Dead State.
"Now,Your DFA is complete" Check it.