Finite Automata: Regular Languages GATE 2013 Question #6937 with Solution

GATE 2013

Theory of ComputationFinite Automata: Regular LanguagesmediumMCQ2 marks

Consider the following deterministic finite automaton (DFA) over the alphabet {0, 1} with states {q0, q1, q2}, where q0 is the start state and q1 is the only accepting state. The transitions are: δ(q0, 0) = q1, δ(q0, 1) = q0, δ(q1, 0) = q2, δ(q1, 1) = q0, δ(q2, 0) = q2, δ(q2, 1) = q2. Which of the following regular expressions denotes the language accepted by this DFA?

A1* 0 (1 1* 0)*B(1 + 01)* 0C1* 0 (1 1* 0)* 1*D(0 + 10)* 1

Save your progress

Related Theory of Computation PYQs

GATE 2013

Which of the following is/are undecidable? 1. G is a CFG. Is L(G) = ϕ? 2. G is a CFG. Is L(G) = Σ*? 3. M is a Turing machine. Is L…

GATE 2013

Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent determin…

GATE 2013

Which of the following languages is NOT regular?

GATE 2013

Which of the following statements is FALSE?

GATE 2013

The language L = {a^n b^m c^m d^n | n, m >= 1} is:

GATE 2013 · session-1

Consider the languages L₁=∅ and L₂={a}. Which one of the following represents L₁L₂* ∪ L₁*?

Saved progressKeep answers, mock results and completion history across devices.

Adaptive practiceGet questions matched to your recent accuracy and difficulty level.

Bookmarks and notesBuild a personal revision list and record why a question was difficult.

Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.

Related Theory of Computation PYQs

Turn practice into measurable progress