GATE Computer Science (CS) 2021 Shift 2 Solved Paper

Question : 19 of 65

Marks: +1, -0

Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?