GATE Computer Science (CS) 2015 Shift 1 Solved Paper

Question : 49 of 65

Marks: +1, -0

Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is____________________