Let L1 be a regular language, L2 be a deterministic context-free language and…

PYQ GATE 2006

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?

  1. A.

    L1 ∩ L2 is a deterministic CFL

  2. B.

    L3 ∩ L1 is recursive

  3. C.

    L1 ∪ L2 is context free

  4. D.

    L1 ∩ L2 ∩ L3 is recursively enumerable

Attempted by 76 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…