Let N be an NFA with n states and let M be the minimized DFA with m states…
PYQ GATE 2008
Let N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the following in NECESSARILY true?
- A.
m ≤ 2n
- B.
n ≤ m
- C.
M has one accept state
- D.
m = 2n
Attempted by 582 students.
Sign up free to check your answer
Sign up freeLoading lesson…

