Pumping Lemma

Lemma

• Given $L$ as a Regular Language
• $\forall$ String $s\in L$, $\exists$ $s^{\prime }$ comprised of $s$ and a subsequence in $s$ that can be repeated/pumped forever s.t $s^{\prime }\in L$