GATE 1987
March 15, 2025GATE 1987
March 15, 2025GATE 1987
|
Question 10
|
A minimal DFA that is equivalent to an NDFA with n nodes has always 2n states.
|
True
|
|
|
False
|
Question 10 Explanation:
A minimal DFA is equivalent to a NDFA with n nodes has atmost 2n states and does not have always 2n states.
Correct Answer: B
Question 10 Explanation:
A minimal DFA is equivalent to a NDFA with n nodes has atmost 2n states and does not have always 2n states.