(pumping lemma): for every regular language L, there exists ℓ>0 (a.k.a. pumping length) s.t. every s∈L with |s|≥ℓ can be written as s=xyz with with ∀i≥0xyiz∈L,|y|>0,|xy|≠0