Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?

Home / Engineering / Theory of Computation and Compiler Design / Question

Mr. Dubey • 51.43K Points
Coach

Q.) Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?

(A) L1 n L2 is a deterministic CFL

(B) L3 n L1 is recursive

(D) L1 n L2 n L3 is recursively enumerable

Correct answer : Option (B) - L3 n L1 is recursive

Discusssion

Related MCQs on Theory of Computation and Compiler Design

Q. Which option of rmdir command will remove all directories a, b, c if path is a/b/c

Q. burning the PROM means

Q. Which of the following is the best approach for automation in the long term?

Q. In OSI model, which of the following layer provides error-free delivery of data?

Q. Functional system testing is:

Q. What will be the efficiency of a Stop and Wait protocol, if the transmission time for a frame is 20ns and the propagation time is 30ns?

Q. Which one of the following algorithm is not used for congestion control?

Q. A logical expression which consist of a sum of product is caleed…..

Q. The VLIW architecture follows ..... approach to achieve parallelism.

Q. Quick sort uses ____ for implementation.