Suppose that \( L_1\) is a regular language and \( L_2\) is a context-free…

GATE · 2021 · CS · Set 1 · Computer Science & IT

Suppose that L1 L_1 is a regular language and L2 L_2 is a context-free language. Which one of the following languages is NOT necessarily context-free?

  1. A.

    L1∩L2L_1 ∩ L_2

  2. B.

    L1⋅L2L_1 \cdot L_2

  3. C.

    L1−L2L_1 - L_2

  4. D.

    L1∪L2L_1 ∪ L_2

Attempted by 193 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…