I’m trying to prove that a language is not regular using the Pumping Lemma, but I’m unsure how to determine if the string I choose has a length greater than or equal to the pumping length pp. For example, with the language 01∗01∗, the minimum pumping length seems to be 2 because the string s=0s=0 cannot be pumped. How do I ensure that the string I choose has a length greater than or equal to pp for the proof?

Any clarification on how to correctly apply the pumping length pp would be greatly appreciated!

I wasn’t able to understand.