GATE CS 2024 (Afternoon) — Question 41

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ2 marks · −2/3 if wrongMedium

Let \( M \) be the 5-state NFA with \( \epsilon \)-transitions shown in the diagram below.
Question image
Which one of the following regular expressions represents the language accepted by \( M \)?
  1. A
    \( (00)^* + 1(11)^* \)
  2. B
    \( 0^* + (1 + 0(00)^* )(11)^* \)
  3. C
    \( (00)^* + (1 + (00)^*)(11)^* \)
  4. D
    \( 0^* + 1(11)^* + 0(11)^* \)
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