UGC NET CSE | June 2019 | Part 2 | Question: 80

Question

For a statement

A language $L \subseteq \Sigma^*$ is recursive if there exists some turing machine $M$. Which of the following conditions is satisfied for any string $\omega$?

• A. If $\omega \in L$, then $M$ accepts $\omega$ and $M$ will not halt
• B. If $\omega \notin L$, then $M$ accepts $\omega$ and $M$ will halt by reaching at final state
• C. If $\omega \notin L$, then $M$ halts without reaching to acceptable state
• D. If $\omega \in L$, then $M$ halts without reaching to an acceptable state

Comments

Answer 3

---

what is meant by acceptable state?

Answer 1

Ans is C , as it is recursive language then TM will either accept or reject but it will always halt .