Engineering-Mathematics
October 28, 2023Question 7873 – Operating-Systems
October 28, 2023GATE 2021 CS-Set-2
|
Question 36
|
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?
|
L U {01}
|
|
|
L.L
|
|
|
{0,1}*-L
|
|
|
L-{01}
|
Question 36 Explanation:
Explanation:If L has a DFA with the number of states k then complement of L will also have a DFA with k states. Hence {0,1}* -L i.e, the complement of L will have k states DFA also.
Correct Answer: C
Question 36 Explanation:
Explanation:If L has a DFA with the number of states k then complement of L will also have a DFA with k states. Hence {0,1}* -L i.e, the complement of L will have k states DFA also.