Let \(L⊆\{0,1\}^∗\) be an arbitrary regular language accepted by a minimal DFA…
GATE · 2021 · CS · Set 2 · Computer Science & IT
Let be an arbitrary regular language accepted by a minimal DFA with states. Which one of the following languages must necessarily be accepted by a minimal DFA with states?
- A.
- B.
- C.
- D.
Attempted by 365 students.
Sign up free to check your answer
Sign up freeLoading lesson…