34. Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least: A. N2 B. 2N C. 2N D. N!
34. Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least: A. N2 B. 2N C. 2N D. N!