GATE 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?

A	L U {01}
B	L.L
C	{0,1}*-L
D	L-{01}

Theory-of-ComputationDFAVideo-Explanation

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.

Navneet Kaur

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments