Pumping Lemma: - Applications of Pumping Lemma Applying It To Prove A Specific Language L Is Not Regular
Pumping Lemma: - Applications of Pumping Lemma Applying It To Prove A Specific Language L Is Not Regular
1 2
3 4
1
Alternate choice of k *
• Proof that L = {aibi | i>0} does not • uv2w = uvvw is not in L
satisfy the pumping condition – uv contains only a’s Pumping Lemma
• Let n be the integer from the • why?
pumping lemma – uvvw = an+|v|bn
• Choose x = anbn • follows from previous line
• Consider all strings u, v, w s.t.
and uvw = x = anbn Some bad applications of the
– uvvw contains more a’s than
• x = uvw and
b’s pumping lemma
• |uv| <= n and
• why?
• |v| >= 1
– Therefore, uvvw is not in L
• Argue that uvkw is not in L for
some k >= 0 • Therefore L does not satisfy
– Argument must apply to all the pumping condition
possible u,v,w
– Continued on right 7 8
• We focus first on bad choices of string x – There exists a k >= 0 such that
uvkw is not in L
• We then consider another flawed technique
9 10
11 12
2
Find the flaw in this proof *
• A language L does not satisfy • Let n be the integer from the
the pumping condition if: pumping lemma Pumping Lemma
– Let n be the integer from the • Choose x = anbn
pumping lemma • Let u = a2, v =a, w = an-3bn
– there exists a string x in L of – |uv| = 3 <= n
length at least n such that
– |v| = 1 Two rules of thumb
– for all strings u, v, w such that
• Choose k = 2
• x = uvw and
• |uv| <= n and • Argue uv2w is not in EQUAL
• |v| >= 1 – uv2w = uvvw = a2aaan-3bn = an+1bn
– There exists a k >= 0 such that – There is one more a than b in uv2w
uvkw is not in L – Thus uv2w is not in L
13 14