GATE CS 2026 (Afternoon) — Question 47

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MSQ2 marksHard

Consider the following two finite automata \( D_1 \) and \( D_2 \).
Question image
Which of the following statements is/are true?
  1. A
    \( L(D_1) = L(D_2) \)
  2. B
    \( L(D_1) \) is a proper subset of \( L(D_2) \)
  3. C
    \( L(D_1) \cap L(D_2) = \{\epsilon\} \)
  4. D
    \( (L(D_1) \cup L(D_2))^* \) consists of all strings in \( \{0, 1\}^* \) whose length is divisible by 3.
Practise the full 2026-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