Computer Sciences > GATE 2021 SET-2 > Automata
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?
Correct : c
Similar Questions
Which of the following is/are undecidable?
Consider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0′s in w and n1(w) be the...
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
Total Unique Visitors
Loading......