Correct answer: (D) Turing machine $M$ accepts all input strings in $L$ and rejects all input strings in $\{0,1\}^{*} - L$.
Explanation
A Turing machine decides a language if it halts on every input and accepts exactly the strings in the language while rejecting all strings not in the language. Options (A), (B), and (C) each capture only part of that definition. Option (D) states both acceptance of all strings in $L$ and rejection of all strings in $\{0,1\}^{*}-L$, which is equivalent to deciding $L$. Therefore, option (D) is correct.
More Turing Machines and Undecidability questions
GATE 2025 CS (CS2) Q25– Let G 1, G 2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar…