0 votes
2 answers
2
How to draw a DFA for the below language.$L$ = {$W | W \in$ $ (0, 1)^* $};$W$ ends with 0 and contains the substring 100 }No. of states in minimal DFA.