For a statement A language \(𝐿⊆Σ^∗\) is recursive if there exists some turing…
PYQ UGC NET 2019
For a statement
A language is recursive if there exists some turing machine . Which of the following conditions is satisfied for any string ?
- A.
If
, thenacceptsandwill not halt - B.
If
, thenacceptsandwill halt by reaching at final state - C.
If
, thenhalts without reaching to acceptable state - D.
If
\(ω∈L,\), thenhalts without reaching to an acceptable state
Attempted by 77 students.
Sign up free to check your answer
Sign up freeLoading lesson…

