UGC-NET | NTA UGC NET 2019 June – II | Question 28

For a statement, ” A language L ⊆ Σ* is recursive if there exists some Turing machine M Which of the following conditions is satisfied for any string w”?
(A) If ω∈L, then M accepts ω and M will not halt
(B) If ω∉L, then M accepts ω and M will halt by reaching at final state
(C) If ω∉L, then M halts without reaching to acceptable state
(D) If ω∈L, then M halts without reaching to an acceptable state


Answer: (C)

Explanation:
It is recursive language then Turing Machine may accept or reject but it will definitely halt at non-final state.
So, Option C is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save