Given an arbitary non-deterministic finite automaton (NFA) with N states, the…
PYQ GATE 2001
Given an arbitary 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!
Attempted by 686 students.
Sign up free to check your answer
Sign up freeLoading lesson…

