Question

the logic of pumping lemma is a good example of
a)the pigeonhole principle
b)the divide and conquer technique
c)recursion
d)iteration

Answer 1

Answer on Question #37764 - Math - Other

the logic of pumping lemma is a good example of

a) the pigeonhole principle

b) the divide and conquer technique

c) recursion

d) iteration

Solution:

In the theory of formal languages in computability theory, 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.

Answer: A.