Pumping lemma for regular languages vs. Pumping lemma for context-free languages
The pumping lemma of context-free languages means finding $x,y,z,v,u$ such $w=xvyuz, |vu|&gt;0,|vxu|\le p$, and for all $n\in\mathbb N$, $xv^nyu^nz$
The regular pumping lemma means finding only $v,y,u$ where $w=abc,|b|&gt;0,|ab|\le p$ and $ab^nc\in L$. (&quot;a&quot;,&quot;b&quot;,&quot;c&quot; here are representing sub-words of w)
So, simply take $x=a,v=b,y=c,u=\epsilon,z=\epsilon$