Let \(L⊆\{0,1\}^∗\) be an arbitrary regular language accepted by a minimal DFA…

GATE · 2021 · CS · Set 2 · Computer Science & IT

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

  1. A.

    L−{01}L-\{01\}

  2. B.

    L∪{01}L \cup \{01\}

  3. C.

    {0,1}∗–L\{0,1\}^* – L

  4. D.

    L⋅LL \cdot L

Attempted by 365 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…