I have this assignment question to find the pumping length of a regular language (L). The regular expression for the L is given as
- What is the length of the longest string that cannot be pumped?
- What is the length of the shortest string that can be pumped, I think this will come naturally when we find the $p$ (the pumping length).
The pumping length of a regular language $L$ is the minimal $p$ such that every word $w \in L$ of length at least $p$ can be split as $w = xyz$ such that (i) $|xy| \leq p$, (ii) $y \neq \epsilon$, (iii) $xy^iz \in L$ for every $i \geq 0$.
As per the answer https://cs.stackexchange.com/a/83727/33673, can we chose $y$ (the middle term in $xy^iz$ to be $1111$ in this case?