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 𝜔𝜔?

  1. A.

     If 𝜔∈𝐿𝜔∈𝐿, then 𝑀𝑀 accepts 𝜔𝜔 and 𝑀𝑀 will not halt

  2. B.

    If 𝜔∉𝐿𝜔∉𝐿, then 𝑀𝑀 accepts 𝜔𝜔 and 𝑀𝑀 will halt by reaching at final state

  3. C.

    If 𝜔∉𝐿𝜔∉𝐿, then 𝑀𝑀 halts without reaching to acceptable state

  4. D.

     If \(ω∈L,\), then 𝑀𝑀 halts without reaching to an acceptable state

Attempted by 77 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…