1 votes 1 votes 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$? If $\omega \in L$, then $M$ accepts $\omega$ and $M$ will not halt If $\omega \notin L$, then $M$ accepts $\omega$ and $M$ will halt by reaching at final state If $\omega \notin L$, then $M$ halts without reaching to acceptable state If $\omega \in L$, then $M$ halts without reaching to an acceptable state Theory of Computation ugcnetcse-june2019-paper2 turing-machine + – Arjun asked Jul 2, 2019 • edited Jul 24, 2019 by Lakshman Bhaiya Arjun 2.1k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ram Swaroop commented Jul 7, 2019 reply Follow Share Answer 3 0 votes 0 votes rish1602 commented Jun 24, 2021 reply Follow Share what is meant by acceptable state? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Ans is C , as it is recursive language then TM will either accept or reject but it will always halt . anurag sharma answered Aug 16, 2019 anurag sharma comment Share Follow See all 0 reply Please log in or register to add a comment.