engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Let L, M be any two context-free languages and X be any regular language.
I. M – X is context-free
II. L ∪ M is context-free
which of the following from the above statement is/are CORRECT?
1
Only 1
2
Only II
3
Both I and II
4
Neither I nor II