UGC-NET | UGC-NET CS 2017 Nov – III | Question 19
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 at least one hole must contain more than one pigeons. And logic of pumping lemma states that- finite state automaton can assume only a finite number of states and because there are infinitely many input sequence, by the pigeon hole principle, there must be at least one state to which the automata returns over and over again.
So, option (D) is correct.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Last Updated :
19 Mar, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...