moreApponPumpingLemma - Fall2004-2005 CSI 301 1 More...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Fall2004-2005 CSI 301 1 More Applications of the Pumping Lemma Fall2004-2005 CSI 301 2 The Pumping Lemma: Given a infinite regular language L there exists an integer m for any string with length L w m w | | we can write z y x w = with and m y x | | 1 | | y such that: L z y x i ... , 2 , 1 , = i Fall2004-2005 CSI 301 3 Regular languages Non-regular languages *} : { = v vv L R Fall2004-2005 CSI 301 4 Theor em: The language is not regular Pr oof: Use the Pumping Lemma *} : { = v vv L R } , { b a = Fall2004-2005 CSI 301 5 Assume for contradiction that is a regular language L Since is infinite we can apply the Pumping Lemma L *} : { = v vv L R Fall2004-2005 CSI 301 6 m m m m a b b a w = We pick Let be the integer in the Pumping Lemma Pick a string such that: w L w m w | | length m and *} : { = v vv L R Fall2004-2005 CSI 301 7 Write z y x a b b a m m m m = it must be that length From the Pumping Lemma a ba bb ab a aa a xyz ... ... ... ... ... ... = x y z m m m m 1 | | , | | y m y x 1 , = k a y k Thus: Fall2004-2005 CSI 301 8 From the Pumping Lemma: L z y x i ... , 2 , 1 , = i Thus: L z y x 2 1 , = k a y k m m m m a b b a z y x = Fall2004-2005 CSI 301 9 From the Pumping Lemma: L a ba bb ab a aa aa a z xy ... ... ... ... ... ... ... = 2 x y z k m + m m m 1 , = k a y k y L z y x 2 Thus: m m m m a b b a z y x = L a b b a m m m k m + Fall2004-2005 CSI 301 10 L a b b a m m m k m + L a b b a m m m k m + BUT: CONTRADI CTI ON!!!...
View Full Document

This note was uploaded on 01/25/2011 for the course CSI 301 taught by Professor Mr.elienasr during the Spring '10 term at American University of Science & Tech.

Page1 / 46

moreApponPumpingLemma - Fall2004-2005 CSI 301 1 More...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online