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:
Verified
Q7: The regular expression have all strings in
Q8: Suppose that a problem A is known
Q9: Which of the following assertions about Turing
Q10: A PC not connected to a network
Q11: Recursively enumerable languages are not closed under:
A)Union
B)Intersection
C)Complementation
D)Concatenation
Q13: Let S be an NP-complete problem, Q
Q14: For s ? (0+1)* let d(s) denote
Q15: A FSM can be considered, having finite
Q16: Which of the following statement is true?
A)All
Q17: Recursively enumerable languages are not closed under
A)Complementation
B)Union
C)Intersection
D)None
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents