Frodo Baggins wrote: > [Pumping Lemma]
> 1 w = xyz > 2 y is not empty > 3 x has less than n caracters That would be xy has less than/equal to n characters (|xy| <= n). > 4 for any integer k, the word w_k = xyy..yz (k times y) is in the > language (i.e. matches the regex) MfG Viktor -- Viktor Rosenfeld E-Mail: mailto:[EMAIL PROTECTED] HertzSCHLAG: http://www.informatik.hu-berlin.de/~rosenfel/hs/
