Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
If L is a CFL and R is a regular language, which of the following is/are true?
1
L ⋂ R is a CFL.
2
L - R is not necessarily a CFL.
3
Both A and B
4
Neither A nor B