GATE CSE 2021 Set 2 Q22: Closure: regular L1 and context-free L2 combinations
- Theory of Computation
- 1 mark
- MSQ
- No negative marking
Question
Let be a regular language and be a context-free language. Which of the following languages is/are context-free?
Try it: multiple select: one or more correct options
Select all correct options. No negative marking, no partial marks.
Show answer and explanation
Answer: B, C, D (official GATE 2021 final answer key)
Concept used: CFLs are closed under intersection with a regular language and under union, but not under complement.
First step: Simplify each with set algebra: (B) is by De Morgan, (C) is , (D) is ; (A) needs .
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2021 Set 2 CS question paper and final answer key, organised by IIT Bombay. Question paper · Answer key
More Theory of Computation PYQs
- 2026 Session 1 · Q25Ambiguity of S → aSbS | bS | ε
- 2026 Session 1 · Q26Impossible minimal DFA sizes for a 6-state NFA
- 2026 Session 1 · Q51What follows from L1 ∩ L2 and L2 being regular
- 2026 Session 1 · Q52Counts of a's and b's in strings of a given CFG
- 2026 Session 2 · Q13Meaning of a Turing machine deciding a language
- 2026 Session 2 · Q29Which of four grammars are ambiguous