pumpredeng - The Pumping Lemma Lemma(Pumping Lemma If L is...

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

View Full Document Right Arrow Icon
The Pumping Lemma Lemma: (Pumping Lemma) If L is a regular language, then there exists a positive integer p (the pumping length) such that every string s L , | s | ≥ p , can be partitioned into three pieces, s = xyz , such that the following conditions hold: | y | > 0 , | xy | ≤ p , and for each i 0 , xy i z L , The Pumping Lemma for Regular Languages – p. 1/5
Background image of page 1

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

View Full DocumentRight Arrow Icon
L is not regular 1. Assume that L is regular (with the aim of reaching a contradiction). 2. Choose a string s L , such that | s | ≥ p where p is the pumping length given by the pumping lemma. The pumping lemma then says that s can be partitioned into three pieces s = xyz where | y | > 0 and | xy | ≤ p , such that xy i z L for all i 0 . 3. Show that for ALL POSSIBLE partitions of s = xyz satisfying | y | > 0 and | xy | ≤ p there exists an i such that xy i z / L . If we succeed to show this, then we have a contradiction with the pumping lemma and our assumption that
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/09/2010 for the course CSE CSE-313 taught by Professor Anupamhalder during the Summer '10 term at Dhaka College.

Page1 / 5

pumpredeng - The Pumping Lemma Lemma(Pumping Lemma If L is...

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

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