Question

Finite Languages satisfy the pumping lemma by having n = .

• A. p*
• B. p + 1
• C. p − 1
• D. p^2

Hint:

For finite languages, consider p + 1 as the pumping constant since no string of length greater than p exists in the language.

Answer 1

The Correct Option is B

Finite languages trivially satisfy the pumping lemma, as the pumping constant n must be greater than the length of the longest string in the language. For a finite language with the longest string of length p, the value of n is p + 1.