GATE CS 2023 (Forenoon) — Question 14

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

Consider the Deterministic Finite-state Automaton (DFA) \( A \) shown below. The DFA runs on the alphabet \( \{0, 1\} \), and has the set of states \( \{s, p, q, r\} \), with \( s \) being the start state and \( p \) being the only final state.
Question image
Which one of the following regular expressions correctly describes the language accepted by \( A \)?
  1. A
    \( 1(0^*11)^* \)
  2. B
    \( 0(0 + 1)^* \)
  3. C
    \( 1(0 + 11)^* \)
  4. D
    \( 1(110)^* \)
Practise the full 2023-FN 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