test series

Question

In the minimal finite automata accepting the set of all strings over {a,b} where the number of a’s and the number of b’s divisible by 4 the total number of non-final states are

 

please someone draw DFA

Answer 1

No of a's divisible by 4 "and" No of b's divisible by 4

So total no of states are 4*4 = 16 and "AND" operation is there so only one final state ...

So no of non-final states =16-1 =15

Comments

(y)    .....

Answer 2

 for just an idea:

Dfa for no. of divisible by 2 and no. of dfa divisible by 2.