Question

What is the pumping length of string of length x?

(a) x+1

(b) x

(c) x-1

(d) x2

This question was addressed to me during an online interview.

This interesting question is from Pumping Lemma for Context Free Language in division Properties of Context Free Languages of Automata Theory

Answer 1

Correct option is (a) x+1

For explanation I would say: There exists a property of all strings in the language that are of length p, where p is the constant-called the pumping length .For a finite language L, p is equal to the maximum string length  in L plus 1.