Question

While applying Pumping lemma over a language, we consider a string w that belong to L and fragment it into _________ parts.

(a) 2

(b) 5

(c) 3

(d) 6

I got this question in examination.

The above asked question is from Pumping Lemma for Regular Language topic in chapter Properties of Regular Languages of Automata Theory

Answer 1

The correct choice is (c) 3

Easiest explanation: We select a string w such that w=xyz and |y|>0 and other conditions. However, there exists an integer n such that |w|>=n for any wÎL.