Re: OT: regular expression question

[Frodo Baggins <thehobbit@altern.org>]

Viktor Rosenfeld scripsit:
>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)

Yes, you're right... It was late at night and I was a bit tired:)))))

-- 
Leo TheHobbit 
IRCnet #leiene
ICQ 56656060

-----BEGIN GEEK CODE BLOCK-----
Version: 3.1
GED/CS d? s-:+>-: a C+++ U+++ L++(+++)>++++ P+++>+++++ E+(++) 
W++ N+ K? o? !w O? M V--- PS+++ PE-- Y+ GPG+ t++ 5? X- R+ tv+ 
b++++ D? DI? G e(++++)* h(+) r--(---) y--(+)>+++*
------END GEEK CODE BLOCK------