GATE CS 2024 (Afternoon) — Question 22

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

Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
Question image
  1. A
    \( 0^* 1(0 + 10^* 1)^* \)
  2. B
    \( 0^* (10^* 11)^* 0^* \)
  3. C
    \( 0^* 1(010^* 1)^* 0^* \)
  4. D
    \( 0(1 + 0^* 10^* 1)^* 0^* \)
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
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