Gate CS-2001 Question Paper With Solutions

Q. 6 Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least

Answer: (B)

Explanation: