GATE CS 2021 (Afternoon) — Question 19

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ1 mark · −1/3 if wrongMedium

Let \(L \subseteq \{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?
  1. A
    \(L - \{01\}\)
  2. B
    \(L \cup \{01\}\)
  3. C
    \(\{0, 1\}^* - L\)
  4. D
    \(L.L\)
Practise the full 2021-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group