Question

Which of the following options is correct for the given statement?

(a) Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2^k.

(b) True

(c) False

This question was posed to me in exam.

This key question is from Applications of DFA topic in portion Finite Automata of Automata Theory

Answer 1

The correct answer is (a) Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2^k.

For explanation: If K is the number of states in NFA, the DFA simulating the same language would have states equal to or less than 2^k.