1
Considering the language $L=\{a^nb \;|\; n \ge 0\}$. This is a regular language since it can be recognized by this automaton:
So, the pumping lemma should be satisfied, However
If I take my pumping constant $p=1$
the smaller string possible is $w=b\;\;\;$ ($|w| \ge p$ is satisfied)
The only pos...
