Question: Let L = {w ? {0, 1}* : w has an even number of 1s, odd number of 0s, and does not contain the substring
Let L = {w ? {0, 1}* : w has an even number of 1s, odd number of 0s, and does not contain the substring 10}. Find a DFA for L with the smallest number of states possible, and explain why there is no smaller DFA for L. (Hint: enumerating some strings in L may help)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
