Let be an NFA with states. Let be the number of states of a minimal DFA which is equivalent to . Which one of the following is necessarily true?
- A
- B
- C
- D
Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ1 mark · −1/3 if wrongEasy
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.