M

Mr. Dubey • 100.69K 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
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. 16 bit address bus can generate ____________ addresses

Q. In a full binary tree if there are L leaves, then total number of nodes N are?

Q. Research can tell you about what, how, many and why in rich, multivariate detail.

Q. Which layer is responsible for process-to-process delivery?

Q. In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic

Q. _________ principle of management states that there should be a place for everything and everything should be in its place.

Q. The DES Algorithm Cipher System consists of ____________rounds (iterations) each with a round key.

Q. Resource sharing helps

Q. Determine the validity of the following argument: S1: all my friends are musicians. S2: John is my friend. S3: None of my neighbours are musicians. S:

Q. All those cryptic messages you see fly by when the Linux kernel first starts up are messages from the initializing and configuring your hardware.

Question analytics