80. 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 w ∈ L, then m accepts w and M will not halt
B) If w ∉ L, then M accepts w and M will halt by reaching at final state
C) If w ∉ L, then M halts without reaching to acceptable state
D) If w ∈ L, then M halts without reaching to an acceptable state
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 w ∈ L, then m accepts w and M will not halt
B) If w ∉ L, then M accepts w and M will halt by reaching at final state
C) If w ∉ L, then M halts without reaching to acceptable state
D) If w ∈ L, then M halts without reaching to an acceptable state
ANS. C
| Previous | Next |
| UGC NET CS 2018 July - II Question 79 | UGC NET CS 2018 July - II Question 81 |
No comments:
Post a Comment