Gate CS-2015-1 Question Paper With Solutions

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

 

Gate CS-2015-1 Question Paper With Solutions

(A) 0

(B) 1

(C) 2

(D) 3

Answer: (B)

Explanation:

Gate CS-2015-1 Question Paper With Solutions

Learn More:   Gate CS-2019 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here