GATE CS 2021,Set-1,Q1:Suppose that L1 is a regular language and L2 is a context-free language. Which
GATE CS 2021,Set-1,Q1: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
Ans : (C) L1−L2
----------------------------------------------------
Subscribe my channel for more updates / monalisacs
----------------------------------------------------------
Join Telegram GATE CS study group: https://t.me/MonalisaCS
----------------------------------------------------------------
Compiler Design Lectures : • Ch 1.1:Language Processing System |CD Lect...
---------------------------------------------------------------
Compiler Design PYQ : • Ch 1.1:Language Processing System |CD Lect...
----------------------------------------------------------------------
Theory Of Computation Lectures • Video
-------------------------------------------------------------------
TOC GATE PYQ: • GATE CS 2010,Q39:Let L={w ∈ (0 + 1)* | w h...
-------------------------------------------------------------------
Data Structure Lecture: • Data Structure Syllabus for GATE
---------------------------------------------------------------------
Data Structure PYQ: • Data Structure Syllabus for GATE
-----------------------------------------------------------------------
#GATE2021#GATECSE#TOC