Q3Theory of Computation

Pumping Lemma states that for any regular language $L$, there exists a constant $p$ such that any string $s\in L$ with $|s|\ge p$ can be split into $s=xyz$ such that $|xy|\le p$, $|y|>0$, and $x{y}^{i}z\in L$ for all $i\ge 0$.