Scribd
Upload
50 views2 pages

Pumping Lemma: - For Every Regular Language L

The Pumping Lemma states that for any regular language L, there exists a number m such that any string w in L of length greater than or equal to m can be divided into three parts xyz where xyiz is also in L for all i ≥ 0, x and y are non-empty, and the length of xy is less than or equal to m.

Uploaded by

midowakil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views2 pages

Pumping Lemma: - For Every Regular Language L

The Pumping Lemma states that for any regular language L, there exists a number m such that any string w in L of length greater than or equal to m can be divided into three parts xyz where xyiz is also in L for all i ≥ 0, x and y are non-empty, and the length of xy is less than or equal to m.

Uploaded by

midowakil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Pumping Lemma

For every regular language L


There is an integer m,
For every string w in L of length m (|w|
m)
We can write w as xyz, such that:
1.|xy| m
2.|y| > 0
3.For all i , xyiz belongs to L

Pumping Lemma

For every regular language L


There is an integer m,
For every string w in L of length
m
We can write w as xyz, such that:
1.|xy| m
2.|y| > 0
You need to cover all possible moves,
so, w is in terms of n.
i

You might also like