What are the minimum pumping length for the following languages ?
(01)*
10(11*0)*0
1011
011
U 0*1*
Here are my solutions. Please correct me if I'm wrong.
01
is the shortest string that can be pumped10100
is the shortest string that can be pumped0
can be pumpedI am not sure about my answers, so any help is appreciated. Thanks a lot!
I think Simon's answer may be a little off. You do, in fact, need to take a cycle somewhere. The pumping lemma requires that the path taken to recognize the string include a cycle (this is the 'y' of the pumping lemma's 'xyz'). We can take this cycle as many times as we want, which pumps the string.