Loading previous year questions
Theory of Computation · Regular Expressions and Finite Automata
Official IIT answer key · IISc Bangalore · Audited Aug 2026
GATE CSE 2016 Set 2 Q42 · MCQ · 2 marks
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 →
Consider the following two statements: I. If all states of an NFA are accepting states then the language accepted by the NFA is *. II. There exists a regular language A such that for all languages B, A B is regular. Which one of the following is CORRECT?
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.