Question 4596 – UGC NET CS 2006 June-Paper-2
March 31, 2024UGC NET CS 2006 June-Paper-2
March 31, 2024Question 4598 – UGC NET CS 2006 June-Paper-2
The logic of pumping lemma is a good example of :
Correct Answer: A
Question 4 Explanation:
→ A pumping lemma (or) pumping argument states that, for a particular language to be a member of a language class, any sufficiently long string in the language contains a section, or
sections, that can be removed, or repeated any number of times, with the resulting string remaining in that language.
→ The proofs of these lemmas typically require counting arguments such as the pigeonhole principle.
→ Hence, the logic of pumping lemma is a good example of the pigeonhole principle.
sections, that can be removed, or repeated any number of times, with the resulting string remaining in that language.
→ The proofs of these lemmas typically require counting arguments such as the pigeonhole principle.
→ Hence, the logic of pumping lemma is a good example of the pigeonhole principle.
pigeon hole principle
recursion
divide and conquer technique
iteration