Skip to content
Related Articles

Related Articles

GATE | GATE CS 2021 | Set 1 | Question 11

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 24 May, 2021

Suppose that L1 is a regular language and L2 is a context-free language. Which one of the following languages is NOT necessarily context-free?
(A) L1∩L2
(B) L1⋅L2
(C) L1−L2
(D) L1∪L2

Answer: (C)

Explanation: CFLs (context-free languages) are not closed under complementation property, so complement of a CFL need not be CFL.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!