Coupon Accepted Successfully!


Pumping Lemma


If A is a regular language, then there is a number P (the pumping length) where, if S is any string in A of length at least P, then S may be divided into three pieces, S = xyz, satisfying the following conditions:–

  1. For each i ≥ 0, xy2z  A
  2. |y| > 0, and
  3. |xy| ≤ P.
  • If a language does not satisfy these conditions, then it is a non-regular language.


Test Your Skills Now!
Take a Quiz now
Reviewer Name