Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
The logic of pumping lemma is an example of _______.
1
iteration
2
recursion
3
the divide and conquer principle
4
the pigeon - hole principle