Solution
= Solution
A language $L$ satisfies the regular pumping lemma if there is an integer $p\geq1$ such that every $w\in L$ with $|w|\geq p$ can be written $w=xyz$ with
$$
\boxed{|xy|\leq p,\qquad |y|\geq1,\qquad xy^iz\in L\quad(i\geq0).}
$$
= Solution
A language $L$ satisfies the regular pumping lemma if there is an integer $p\geq1$ such that every $w\in L$ with $|w|\geq p$ can be written $w=xyz$ with
$$
\boxed{|xy|\leq p,\qquad |y|\geq1,\qquad xy^iz\in L\quad(i\geq0).}
$$