engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Finite Automata
Let 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?
1
k ≥ 2n
2
k ≥ n
3
k ≤ n2
4
k ≤ 2n