Loading previous year questions
Theory of Computation · Regular Expressions and Finite Automata
Official IIT answer key · IIT Bombay · Audited Aug 2026
GATE CSE 2021 Set 2 Q9 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Regular Expressions and Finite AutomataPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
The topic of Regular Expressions and Finite Automata is one of the highest-weight core areas in GATE CS Theory of Computation. Questions test minimal DFA state counting under modulo/substring constraints, state equivalence and minimization, regular expression derivation from transition graphs (and vice versa), NFA-to-DFA powerset bounds (2n), and language membership/closure properties. The distribution balances 1-mark foundational conceptual checks with 2-mark state-tracing and counting problems.
Full Regular Expressions and Finite Automata guide →All 41 questions on Regular Expressions and Finite Automata →
Let L \0, 1\* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.