Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Which of the following is TRUE about the Pumping Lemma for regular language?
1
It applies to all regular language
2
It applies only to infinite regular languages
3
It applies to all context - free languages
4
It applies to all recursively enumerable languages