Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
The “Pumping lemma for context free languages” when applied to a given language L can be used for which of the following purposes?
1
To prove that L is unambiguous.
2
To prove that L is context free.
3
To prove that L is not context free.
4
All of these