Solution
= Solution
The <pumping lemma for regular languages> says that for some $N$, every accepted word $w$ of length at least $N$ factors $w=xyz$ with $|xy|\le N$, $|y|>0$, and $xy^kz$ accepted for every $k\ge0$.
= Solution
The <pumping lemma for regular languages> says that for some $N$, every accepted word $w$ of length at least $N$ factors $w=xyz$ with $|xy|\le N$, $|y|>0$, and $xy^kz$ accepted for every $k\ge0$.