The logic of pumping lemma is an example of __________.
(A) iteration
(B) recursion
(C) the divide and conquer principle
(D) the pigeon – hole principle


Answer: (D)

Explanation: Pigeon-hole principle states that if there are n pigeons fly into m hole and n > m then atleast one hole must contain more then one pigeons. And logic of pumping lemma states that- finite state automaton can assume only a finite number of states and because there are infintely many input sequence, by the pigeon hole principle , there must be atleast one state to which the automata returns over and over again.

So, option (D) is correct.

Quiz of this Question