Scribd
Upload
33 views

Is Not Regular Ex. (0 1 - N 0) NN NO! Can FA Recognize All Computable'' Languages?

1. The document discusses the pumping lemma and how it can be used to prove that certain languages are not regular. 2. The pumping lemma states that for any regular language, there exists a pumping length p such that any string longer than p can be broken into x, y, z where y can be repeated and the result will still be in the language. 3. An example shows how to use the pumping lemma to prove that the language L={0^n 1^n | n>0} is not regular by pumping different parts of the string and showing the result is not in L.

Uploaded by

tushar886
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Is Not Regular Ex. (0 1 - N 0) NN NO! Can FA Recognize All Computable'' Languages?

1. The document discusses the pumping lemma and how it can be used to prove that certain languages are not regular. 2. The pumping lemma states that for any regular language, there exists a pumping length p such that any string longer than p can be broken into x, y, z where y can be repeated and the result will still be in the language. 3. An example shows how to use the pumping lemma to prove that the language L={0^n 1^n | n>0} is not regular by pumping different parts of the string and showing the result is not in L.

Uploaded by

tushar886
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Limits of FA

Can FA recognize all ‘‘computable’’ languages?


n n
NO! Ex. { 0 1 | n > 0} is not regular

Pumping Lemma

Pumping Lemma
If A is a regular language, then there is a no. p
where, if s is any string in A of length
at least p, s may be divided into three pieces x,y,z,
s = xyz, such that all of the following hold:
1. for each i > 0, xy i z is in A
2. |y| > 0
3. |xy| > p
Alternating Quantifers in the Pumping Lemma
1. For each regular language L

2. There exists a pumping length p for L

3. For every string s in L of length > p

4. There exists x, y, z, with s = xyz, |y| > 0 and


|xy| > p.

5. For each i > 0 xy i z in L.

Pumping Lemma Example


n n
L = { 0 1 | n > 0} is not regular.
Suppose L were regular. Then let p be the pumping
length given by the pumping lemma.
pp
Let s = 0 1 in L. Note that |s| > p, so s = xyz with
1. for each i > 0, xy i z is in L
2. |y| > 0

y=0 ... 0
Then xyyz will have more 0’s than 1’s,
so it cannot be in L, a contradiction.
Pumping Lemma Example

y=1 ... 1
Then xyyz will have more 1’s than 0’s,
so it cannot be in L, a contradiction.

y = 0 ... 0 1 ... 1
Then xyyz will have 0’s and 1’s out of order,
with some 1’s before 0’s, a contradiction.
Since these are all possible cases, we can
conclude that L is not regular.

Pumping Lemma Example, using 3.


n n
L = { 0 1 | n > 0} is not regular.
Suppose L were regular. Then let p be the pumping
length given by the pumping lemma.
pp
Let s = 0 1 in L. Note that |s| > p, so s = xyz with
1. for each i > 0, xy i z is in L
2. |y| > 0
3. |xy|> p
It must be the case that y = 0 ... 0, since xy
is shorter than p.
But then xyyz will have more 0’s than 1’s,
so it cannot be in L, a contradiction.
Another Example

Show { an bncn | n > 0} is not regular.

n+m
Show { an bamba | n, m > 1} is not regular.

You might also like