Loading previous year questions
Theory of Computation · Regular and Context-Free Languages
Official IIT answer key · IIT Kharagpur · Audited Aug 2026
GATE CSE 2014 Set 3 Q36 · MCQ · 2 marks
Key concept
No account needed
Sit 5 related Regular and Context-Free LanguagesPYQs 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
GATE consistently tests Regular and Context-Free Languages by evaluating closure properties, set-theoretic algebraic manipulations, and language classification (Regular vs. DCFL vs. CFL vs. Non-CFL). Questions heavily emphasize edge-case reasoning with universal ( *) and empty ( ) languages, as well as structural recognizability via finite automata versus deterministic/non-deterministic pushdown automata. Recent exams (2021–2026) strongly favor Multi-Select Questions (MSQ) testing multiple interdependent closure and membership assertions simultaneously.
Full Regular and Context-Free Languages guide →Consider the following languages over the alphabet = \0, 1, c\: aligned L1 &= \0n 1n n 0\ L2 &= \w c wr w \0, 1\*\ L3 &= \w wr w \0, 1\*\ aligned Here, wr is the reverse of the string w. Which of these languages are deterministic Context-free languages?
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.