Minimum number of states required to construct DFA accepting language L={ w | w has even no of 0's and 1's and odd no of 3's } over alphabet { 0,1,2,3 } The answer given is 8. Should not the ans be 16? Using the concept of combinations there are 2 ... is fixed and 2 can take either one. Is it possible to get 8 states after minimization for the above DFA? Any simpler way of finding that logically?