Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

(A) (L1)’ is recursive and (L2)’ is recursively enumerable

(B) (L1)’ is recursive and (L2)’ is not recursively enumerable

(C) (L1)’ and (L2)’ are recursively enumerable

(D) (L1)’ is recursively enumerable and (L2)’ is recursive

Correct answer : Option (B) - (L1)’ is recursive and (L2)’ is not recursively enumerable

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. The SOM was a neural network model developed by__________.

Q. In case of OR gate, no matter what the number of inputs, a

Q. which one of the following can be erased using electricity

Q. What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))

Q. How many numbers could ENIAC store in its internal memory

Q. Message ________ means privacy that the sender and reciever expect privacy.

Q. The important feature of the VLIW is ______?

Q. which of the following cases will K-Means clustering give poor results? 1. Data points with outliers 2. Data points with different densities 3. Data points with round shapes 4. Data points with non-convex shapes

Q. Data communication system spanning states, countries, or the whole world is ________

Q. Which of the following happens?