GATE CS 2026 (Afternoon) — Question 13

Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ1 mark · −1/3 if wrongMedium

Which one of the following statements is equivalent to the following assertion? Turing machine \( M \) decides the language \( L \subseteq \{0, 1\}^* \).
  1. A
    Turing machine \( M \) halts on all input strings in \( \{0, 1\}^* \)
  2. B
    Turing machine \( M \) accepts all input strings in \( L \)
  3. C
    Turing machine \( M \) rejects all input strings in \( \{0, 1\}^* - L \)
  4. D
    Turing machine \( M \) accepts all input strings in \( L \) and rejects all input strings in \( \{0, 1\}^* - L \)
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Turing Machines & UndecidabilityTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group