Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which of the following statements is true ?
1
The union of two context free languages is context free.
2
The intersection of two context free languages is context free.
3
The complement of a context free language is context free.
4
If a language is context free, it can always be accepted by a deterministic pushdown automaton.