M

Mr. Dubey • 100.69K Points
Coach

Q. Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

  • (A) L2 – L1 is recursively enumerable.
  • (B) L1 – L3 is recursively enumberable
  • (C) L2 intersection L1 is recursively enumberable
  • (D) L2 union L1 is recursively enumberable
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. How many flip-flop are needed to divide the input frequency by 64 ?

Q. The port for connecting broadband cable to a computer is called .

Q. Service Provision Life-Cycle - Maintenance Phase .........

Q. Which of the following patterns allows multiple objects an opportunity to process a request without guaranteeing that any of them must process it?

Q. The time taken to move the disk arm to the desired cylinder is called the

Q. What is the running time of Chan’s algorithm?

Q. Validation plan describes

Q. If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called

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

Q. effects⁺ (a) in Forward State Space Planning denotes ___________________

Question analytics