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?

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.17K 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 enumerable

(D) L2 union L1 is recursively enumerable

Correct answer : Option (B) - L1-L3 is recursively enumerable

Discusssion

Related MCQs on Theory of Computation

Q. The iconic feature of the RISC machine among the following is

Q. A chronological record of relevant details about the execution of tests is called as, a _______

Q. A second technique to reduce routing table and simplify searching process is called

Q. Name the data type which is involved in procedure activation.

Q. Which are the types of integrity rule:

Q. A two-dimensional array contain the details of all the segment are called

Q. Once the BUS is granted to a device

Q. EyeTap Display works on sensors.

Q. Any successive write operation by a process on a data item x will be performed on a copy of x that is up to date with the value most recently read by that process.

Q. If are does not want anyone else to read or write to a file named datfile,except through a program in a file filex,then he may use