GATE | GATE CS 2018 | Question 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 ≥ 2ⁿ
(B) k ≥ n
(C) k ≤ n²
(D) k ≤ 2ⁿ


Answer: (D)

Explanation: The minimum number of state in DFA will be 1 when we have only starting state and all other states will not be reachable from stating state.
The maximum number of state in DFA will be 2ⁿ as the number of subsets of a set with n elements in the worst case.

Therefore, k ≤ 2ⁿ
Option (D) is correct.

Related question – GATE | Gate IT 2008 | Question 6

Quiz of this Question

My Personal Notes arrow_drop_up

Save