Summary of Facts Found

These facts can be formally stated in the following way:

The Pumping lemma

If A is a regular language, then there is a number p (the number of states in a FSA that recognizes the language, also known as 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 xyiz is an element of A
  2. |y| > 0
  3. |xy| <= p

Pumping 10