GATE CS 2021 (Forenoon) — Question 48

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

Consider the following language: \(L = \{w \in \{0,1\}^* \mid w \text{ ends with the substring 011}\}\) Which one of the following deterministic finite automata accepts \(L\)?
  1. A
    Question image
  2. B
    Question image
  3. C
    Question image
  4. D
    Question image
Practise the full 2021-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