Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages

Consider R to be any regular language and L​1, L​2​ be any two context-free languages Which one of the following is correct?

1
(L1 ∪ L2)’ − R is context free
2
L1 − R is context free
3
L’1 is context free
4
L1 ⋂ L2 is context free
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters