Question:

Finite Languages satisfy the pumping lemma by having n = .

Show Hint

For finite languages, consider p + 1 as the pumping constant since no string of length greater than p exists in the language.
Updated On: Dec 29, 2024
  • p*
  • p + 1
  • p − 1
  • p^2
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

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.
Was this answer helpful?
0
0

Questions Asked in CUET PG exam

View More Questions