Gate CS-2018 Question Paper With Solutions

Q. 26 Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?

(A) k ≥ 2n

(B) k ≥ n

(C) k ≤ n2

(D) k ≤ 2n

Answer: (D)

Explanation:

Gate CS-2018 Question Paper With Solutions

Learn More:   Gate EE-2018 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here