- A.
- B.
- C.
- D.
Studying seriously for GATE CSE?
Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.
See GATE CSE betaOpen notebookGATE 20222022PYQMSQanswer keyexplanationmedium
Theory of Computation · Turing Machines & Computability
Concept intelligence
Jump into a concept drill from this question.
Recurring concept
See all 50 →Turing Machines & Computability has appeared in GATE CSE & IT 50 times across 27 years (2021, 2022, 2023, 2025, 2026, ...).
More questions on Turing Machines & Computability
See all →- 2026 QWhich one of the following statements is equivalent to the following assertion? Turing machine $M$ decides the...
- 2025 QLet $G_1, G_2$ be Context Free Grammars (CFGs) and $R$ be a regular expression. For a grammar $G$, let $L(G)$...
- 2023 QWhich of the following statements is/are CORRECT?
- 2022 QWhich of the following statements is/are TRUE?
- 2021 QFor a Turing machine M, {M} denotes an encoding of M. Consider the following two languages. L 1 = {(M) | M tak...
- 2021 QConsider the following two statements about regular languages: S 1 : Every infinite regular language contains...
- 2021 QLet $$\left\langle M \right\rangle $$ denote an encoding of an automation M. Suppose that ∑ = {0, 1}. Which of...
- 2020 QWhich of the following languages are undecidable? Note that $$\langle M\rangle $$ indicates encoding of the Tu...
undecidabilityrices theoremturing machines