GATE | GATE-CS-2015 (Set 1) | Question 65

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 __________.

(A) 0
(B) 1
(C) 2
(D) 3

Answer: (B)
Explanation: In DFA M: all strings must end with ‘a’.
In DFA N: all strings must end with ‘b’.

So the intersection is empty.

For an empty language, only one state is required in DFA. The state is non-accepting and remains on itself for all characters of alphabet.

Quiz of this Question