GATE CSE 2022 Q23: True statements about RE, recursive, CFL and regular languages
- Theory of Computation
- 1 mark
- MSQ
- No negative marking
Question
Which of the following statements is/are TRUE?
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 2022 final answer key)
Concept used: Closure properties: recursive languages are closed under complement, and regular languages under intersection.
First step: For (A), note is recursively enumerable and contains every language, including undecidable ones.
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 2022 CS question paper and final answer key, organised by IIT Kharagpur. 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