A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 ≤ 2^n
b. n ≤ m
c. M has one accept state
d. m = 2^n
Answer:m ≤ 2^n
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: