Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Pumping lemma for regular language is generally used for proving :
1
whether two given regular expressions are equivalent
2
a given grammar is ambiguous
3
a given grammar is regular
4
a given grammar is not regular