Which one of the following statements is equivalent to the following…

PYQ GATE 2026

Which one of the following statements is equivalent to the following assertion? Turing machine 𝑀 decides the language 𝐿 ⊆ {0,1}∗

  1. A.

    Turing machine 𝑀 halts on all input strings in {0,1}∗

  2. B.

    Turing machine 𝑀 accepts all input strings in 𝐿

  3. C.

    Turing machine 𝑀 rejects all input strings in {0,1}∗ − 𝐿

  4. D.

    Turing machine 𝑀 accepts all input strings in 𝐿 and rejects all input strings in {0,1}∗ − 𝐿

Attempted by 241 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…