GATE 2026 TOC PYQs | Undecidability

Last Updated :
Discuss
Comments

Question 1

Which one of the following statements is equivalent to the following assertion?

Turing machine M decides the language L ⊆ {0,1}*. [GATE 2026 || SET-2 MSQ || 1-mark]

  • Turing machine M halts on all input strings in {0,1}*

  • Turing machine M accepts all input strings in L

  • Turing machine M rejects all input strings in {0,1}* − L

  • Turing machine M accepts all input strings in L and rejects all input strings in {0,1}*−L

Tags:
GATE

There are 1 questions to complete.

Take a part in the ongoing discussion