Let L be a regular language. Then there exists a constant n such that for every string w in L such that w>=n, we can break w into three strings w=xyz such that
i. y not equal to epsilon
ii. xy<=n
iii. for all k>=0, the string xy to the power k,z is also in L
The famed pumping lemma theoran which is driving me nuts, welcome to the world of vtu, where nothing makes sense and the only thing which helps u is your memory. The biggest question mark ever comes to mind when I read through this
Subscribe to:
Post Comments (Atom)
7 comments:
?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????
my sentiments exactly
I don know where to write about ur pumping-lemma problem here, or scrapbook or mailing.
Wikipedia is your friend.
god bless u..i swear why on earth these thse things r written no idea and for me i was in love with the
Schrodinger equation spent so much time with it felt as if dating the equation....but no luck with it and then i did the most imtelligent thing left it for good so no heartbreaks
thank u, i don't think even wiki can help me, its a personal battle, I'll have to fight it out
and shrodinger was a mysterious foe, this one's a lethal killer
Post a Comment