Pumping Lemma

The Pumping Lemma for
Regular Languages
The Pumping Lemma forRegular Languages p.1/39

Consider the language

Nonregular languages
.


.
If we attempt to find a DFA that recognizes we discover that

such a machine needs to remember how many s have been
seen so far as it reads the input


.

Because the number of s isnt limited, the machine needs to

keep track of an unlimited number of possibilities


.

Because the number of s isnt limited, the machine needs to

keep track of an unlimited number of possibilities
This cannot be done with any finite number of states
Intuition may fail us

Just because a language appears to require
unbounded memory to be recognized, it doesnt mean
that it is necessarily so

Example:


Example:
has an equal number of 0s and 1s


Example:
has an equal number of 0s and 1s not regular


Example:
has equal no of 01 and 10 substrings


Example:
has equal no of 01 and 10 substrings regular
Language nonregularity
The technique for proving nonregularity of some
language is provided by a theorem about regular
languages called pumping lemma
Pumping lemma states that all regular languages have
a special property
Pumping lemma states that all regular languages have
a special property
If we can show that a language does not have this
property we are guaranteed that is not regular.
Observation
Pumping lemma states that all regular languages have a
special property.
Observation
special property.
Pumping lemma does not state that only regular languages
have this property. Hence, the property used to prove that
a language is not regular does not ensure that language
is regular.
Observation
special property.
Pumping lemma does not state that only regular languages
have this property. Hence, the property used to prove that
a language is not regular does not ensure that language
is regular.
Consequence: A language may not be regular and still have
strings that have all the properties of regular languages.
Pumping property
All strings in the language can be pumped" if they are at
least as long as a certain value, called the pumping length
Pumping property
All strings in the language can be pumped" if they are at
least as long as a certain value, called the pumping length
Meaning: each such string in the language contains a section that can be repeated any number of times with the resulting string remaining in the language.
Theorem 1.70
Pumping Lemma: If is a regular language, then there is

a pumping length such that:
Theorem 1.70

is any string in
of length at least ,
If
Theorem 1.70

Then may be divided into three pieces,

satisfying the following conditions:
is any string in
If
Theorem 1.70

is any string in

1. for each

If
Theorem 1.70

is any string in

2.
1. for each

If
Theorem 1.70

is any string in

3.
2.
1. for each

If
represents the length of string and

may be concatenated times, and
Recall that
means that
Interpretation
may be , but
or
, either

When
Recall that
means that
Interpretation
may be , but
Without condition
or
, either

When
Recall that
means that
Interpretation
theorem would be trivially true

Let
Proof idea
be a DFA that recognizes

Assign a pumping length
Let
Proof idea
to be the number of states of


to be the number of states of

Assign a pumping length
Show that any string

,
may be broken into three
satisfying the pumping lemmas conditions
pieces
Let
Proof idea
More ideas
and
, consider a sequence of states that
goes through to accept , example:

If
More ideas
and

then the
must be final;if
is

Since
accepts ,
length of

If
More ideas
and

If

it result that
and

then the

must be final;if
is

Because

Since
accepts ,
length of
More ideas
and

If

it result that
and

then the

must be final;if
is

Because

Since
accepts ,
length of
By pigeonhole principle:
More ideas
and

If

it result that
and

then the

must be final;if
is

Because

Since
accepts ,
length of
- If p pigeons are placed into fewer than p holes, some holes must
hold more than one pigeon
More ideas
and

If

then the
it result that
and

must be final;if
is

Because

Since
accepts ,
length of

the sequence
state, see Figure 1

- If p pigeons are placed into fewer than p holes, some holes must
hold more than one pigeon
must contain a repeated

repeats when
reads
Figure 1: State

Recognition sequence
in to the three pieces: , , and

Divide
More ideas, continuation
is the part of
appearing before
Piece

Divide

is the part of
appearing before
is the part of
between two appearances of
Piece
Piece
Divide

Piece
appearing before
is the part of
is the part of
after the 2nd appearance of
Piece
is the part of
Piece
Divide

Piece
appearing before
is the part of
is the part of
Piece
is the part of
Piece
Divide
In other words:

Piece
appearing before
is the part of
is the part of
Piece
is the part of
Piece
Divide
from
to
takes

In other words:
,

Piece
appearing before
is the part of
is the part of
Piece
is the part of
Piece
Divide
from
to
takes
to
from

takes
In other words:
,
,

Piece
appearing before
is the part of
is the part of
Piece
is the part of
Piece
Divide
to
from
takes
to
,
,
from
to

takes

from
takes
In other words:
Note
The division specified above satisfies the 3 conditions
on
Suppose that we run
Observations
, and in
which is also

Condition 1: it is obvious that

accepts
for all
. For
,
general
to
accepted because takes
on
Suppose that we run
Observations
, and in
which is also


accepts
for all
. For
,
general
to
on
Suppose that we run
Observations
is
Condition 2: Since
, state is repeated. Then because
.
the part between two successive occurrences of ,
, and in
which is also


accepts
for all
. For
,
general
to
on
Suppose that we run
Observations
is
Condition 2: Since
, state is repeated. Then because
.
the part between two successive occurrences of ,
Condition 3: makes sure that is the first repetition in the

states in
sequence. Then by pigeonhole principle, the first
the sequence must contain a repetition. Therefore,

Pumping lemmas proof

Let
be a DFA that has states and
recognizes . Let
be a string over of
length
. Let
be the sequence of states
,
while processing , i.e.,


elements in
.

and among the first

two must be the same state, say

Let
recognizes . Let
be a string over of
length
. Let
,


places in the sequence

Because occurs among the first

starting at , we have
elements in
.

and among the first


Let
recognizes . Let
be a string over of
length
. Let
,


places in the sequence
Now let

Because occurs among the first

starting at , we have
elements in
.
and among the first


Let
recognizes . Let
be a string over of
length
. Let
,
Note

for
to , and takes
must accept
,

takes
from to , takes
from
from to
, which is an accept state,
As
Note

, so
We know that
for
to , and takes
must accept
,

takes
from to , takes
from
from to
As
Note

, so
We also know that
;

, so
We know that
for
to , and takes
must accept
,

takes
from to , takes
from
from to
As
Note

, so
We also know that
;

, so
We know that
for
to , and takes
must accept
,

takes
from to , takes
from
from to
As
Thus, all conditions are satisfied and lemma is proven
Before using lemma

Note: To use this lemma we must also ensure that if the
property stated by the pumping lemma is true then the
language is regular.
Before using lemma

Proof: assuming that each element of language satisfies
the three conditions stated in pumping lemma we can
easily construct a FA that recognizes , that is, is regular.
Before using lemma

Proof: assuming that each element of language satisfies
the three conditions stated in pumping lemma we can
easily construct a FA that recognizes , that is, is regular.
Note: if only some elements of
mean that
satisfy the three conditions it does not
is regular.
Using pumping lemma (PL)

Proving that a language
is not regular using PL:


1. Assume that
is regular in order to obtain a contradiction


1. Assume that
2. The pumping lemma guarantees the existence of a pumping

length s.t. all strings of length or greater in can be pumped


1. Assume that

2. The pumping lemma guarantees the existence of a pumping

length s.t. all strings of length or greater in can be pumped
3. Find
,
, that cannot be pumped: demonstrate that
cannot be pumped by considering all ways of dividing into , , ,
showing that for each division one of the pumping lemma
, (2)
, (3)
, fails.
conditions, (1)
Observations
The existence of contradicts pumping lemma, hence
cannot be regular
Observations
The existence of contradicts pumping lemma, hence
cannot be regular
Finding sometimes takes a bit of creative thinking.
Experimentation is suggested

Example 1: prove that

Applications
is not regular
such that for any
; obviously

be the pumping length of

. By pumping

lemma

. Choose
is not regular
is regular and let

Assume that
Example 1: prove that

Applications
Example, continuation
Consider the cases:
Consider the cases:
has more s than s and

consists of s only. In this case

so it is not in , violating condition 1
1.
Consider the cases:


1.
consists of s only. This leads to the same contradiction

2.
Consider the cases:


1.
consists of s and s. In this case

may have the same
number of s and s but they are out of order with some s before
some s hence it cannot be in either
3.
2.
Consider the cases:


1.
consists of s and s. In this case

may have the same
number of s and s but they are out of order with some s before
some s hence it cannot be in either

3.
2.
The contradiction is unavoidable if we make the assumption

that
is regular so
is not regular

Prove that
is not regular
Example 2
is regular and
for any
, where
is its pumping length.
. Then pumping lemma guarantees

with

that
Let
Proof: assume that
Prove that
is not regular
Example 2
Note

If we take the division

,
it seems that
indeed, no contradiction occurs. However:
Note

and
Condition 3 states that

, and in our case
. Hence,
cannot be pumped

,
it seems that
Note

and

, and in our case
. Hence,
cannot be pumped

,
it seems that

If
then must consists of only s, so
there are more 1-s than 0-s.
because
Note

and

, and in our case
. Hence,
cannot be pumped

,
it seems that

If
then must consists of only s, so
there are more 1-s than 0-s.
because
This gives us the desired contradiction
leads us to trouble because this string

for any
Then
can be pumped by the division:
Selecting
Other selections
An alternative method
Use the fact that
is nonregular.
Use the fact that
were regular then

would also be regular because
is regular and of regular languages is a regular language.
If
is nonregular.
Use the fact that

But
were regular then

If
is nonregular.
which is not regular.
Use the fact that

Hence,
But
were regular then

If
is nonregular.
which is not regular.
is not regular either.
is nonregular using

Show that
pumping lemma

Example 3
Proof: Assume that
is nonregular using

Show that
pumping lemma

Example 3
. Since

Consider
is regular and is its pumping length.

and
satisfiesthe conditions of the pumping lemma.
Note
Condition 3 is again crucial because without it we

, so
could pump if we let
Note
exhibits the essence of the

The string
nonregularity of


, so
Note
exhibits the essence of the

The string
nonregularity of


, so
we fail because this string
If we chose, say
can be pumped

Show that
Example 4
is nonregular.

Show that
Example 4
is nonregular.
Proof by contradiction: Assume that
can be split,
where for all
Pumping lemma guarantees that
be its pumping length. Consider
is regular and let
Searching for a contradiction
The elements of are strings whose lengths are perfect

squares. Looking at first perfect squareswe observe that
they are: 0, 1, 4, 9, 25, 36, 49, 64, 81,

they are: 0, 1, 4, 9, 25, 36, 49, 64, 81,
Note the growing gap between these numbers: large members
cannot be near each other

they are: 0, 1, 4, 9, 25, 36, 49, 64, 81,
which differ from each other
Consider two strings

and
by a single repetition of .


they are: 0, 1, 4, 9, 25, 36, 49, 64, 81,
which differ from each other

Consider two strings

and
by a single repetition of .

If we chose very large the lengths of

and
cannot be
both perfect square because they are too close to each other.
Turning this idea into a proof

Calculate the value of that gives us the contradiction.


, calculating the difference we obtain

If


, calculating the difference we obtain

If
By pumping lemma
and
are both perfect
we can see that they
squares. But letting
,
cannot be both perfect square if
because they would be too close together.
Value of for contradiction

To calculate the value for that leads to contradiction we

observe that:

observe that:
. Then
Let

observe that:
Example 5
Sometimes pumping down" is useful when we apply
pumping lemma.
Example 5
pumping lemma.

We illustrate this using pumping lemma to prove that

is not regular
Example 5
pumping lemma.

We illustrate this using pumping lemma to prove that

is not regular
is
Proof: by contradiction using pumping lemma. Assume that

regular and its pumping length is .

; From decomposition
, from
it results that consists only of 0s.

Let
condition 3,

, from

Let
condition 3,
Let us examine
to see if it is in . Adding an
extra-copy of increases the number of zeros. Since
contains all strings
that have more 0s than 1s, it
will still give a string in

, from

Let
condition 3,
Let us examine
to see if it is in . Adding an
extra-copy of increases the number of zeros. Since
contains all strings
that have more 0s than 1s, it
will still give a string in

, consider

even when
and
Since
Try something else

.

, consider

even when
and
Since
Try something else

.
This decreases the number of 0s in .

, consider

even when
and
Since
Try something else
cannot have
cannot be in

and
Since has just one more 0 than 1 and

more 0s than 1s,

, consider

even when
and
Since
Try something else
cannot have
cannot be in

and
Since has just one more 0 than 1 and

more 0s than 1s,
This is the required contradiction
Minimum pumping length
The pumping lemma says that every regular language

has a pumping length , such that every string in the
language of length at least can be pumped.

Hence, if is a pumping length for a regular language

so is any length
.

The minimum pumping length for

that is a pumping length for .
is the smallest
Hence, if is a pumping length for a regular language

so is any length
.
Consider

Example
. The minimum pumping length for
is 2.
is 2.
and cannot be pumped. But any

where
can be pumped because for

and

. Hence, the minimum pumping length for
string
Reason: the string
. The minimum pumping length for

Consider
Example
is 2.
Find the minimum pumping length for the language
Problem 1
.

is 4.
cannot be pumped. Hence, 3 is not a

but
Reason:
Solution: The minimum pumping length for
Problem 1

and

. If

the division
pumping length for
can be pumped by
Problem 2
.

Solution: The minimum pumping length of
Problem 2
.
is 1.
is 1.
of
and
can be pumped by the division:

in the language but cannot be pumped. Every nonempty string

cannot be 0 because is
Reason: the minimum pumping length for
Solution: The minimum pumping length of
Problem 2
first character
the rest of .
Problem 3


.
Problem 3



.
is 3.
Problem 3
and
we can write is as
is the rest of the string.

we can write it as
is generated by
is the first symbol of , and

If
is generated by
of length at least 3. If
is in the
be a string in the language

language and it cannot be pumped. Let
Reason: The pumping length cannot be 2 because the string
is 3.



.
is the remainder of .

Pumping Lemma

Uploaded by

Copyright:

Available Formats

Pumping Lemma

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Pumping Lemma

Uploaded by

Copyright:

Available Formats

The Pumping Lemma for

The Pumping Lemma forRegular Languages p.1/39

Consider the language

The Pumping Lemma forRegular Languages p.2/39

Consider the language

If we attempt to find a DFA that recognizes we discover that

The Pumping Lemma forRegular Languages p.2/39

Consider the language

If we attempt to find a DFA that recognizes we discover that

Because the number of s isnt limited, the machine needs to

The Pumping Lemma forRegular Languages p.2/39

Consider the language

If we attempt to find a DFA that recognizes we discover that

Because the number of s isnt limited, the machine needs to

The Pumping Lemma forRegular Languages p.2/39

Intuition may fail us

The Pumping Lemma forRegular Languages p.3/39

Intuition may fail us

The Pumping Lemma forRegular Languages p.3/39

Intuition may fail us

The Pumping Lemma forRegular Languages p.3/39

Intuition may fail us

The Pumping Lemma forRegular Languages p.3/39

Intuition may fail us

has an equal number of 0s and 1s not regular

The Pumping Lemma forRegular Languages p.3/39

Intuition may fail us

has an equal number of 0s and 1s not regular

The Pumping Lemma forRegular Languages p.3/39

The Pumping Lemma forRegular Languages p.4/39

The Pumping Lemma forRegular Languages p.4/39

The Pumping Lemma forRegular Languages p.4/39

The Pumping Lemma forRegular Languages p.5/39

The Pumping Lemma forRegular Languages p.5/39

The Pumping Lemma forRegular Languages p.5/39

The Pumping Lemma forRegular Languages p.6/39

The Pumping Lemma forRegular Languages p.6/39

Pumping Lemma: If is a regular language, then there is

The Pumping Lemma forRegular Languages p.7/39

Pumping Lemma: If is a regular language, then there is

The Pumping Lemma forRegular Languages p.7/39

Pumping Lemma: If is a regular language, then there is

Then may be divided into three pieces,

The Pumping Lemma forRegular Languages p.7/39

Pumping Lemma: If is a regular language, then there is

Then may be divided into three pieces,

The Pumping Lemma forRegular Languages p.7/39

Pumping Lemma: If is a regular language, then there is

Then may be divided into three pieces,

The Pumping Lemma forRegular Languages p.7/39

Pumping Lemma: If is a regular language, then there is

Then may be divided into three pieces,

The Pumping Lemma forRegular Languages p.7/39

represents the length of string and

The Pumping Lemma forRegular Languages p.8/39

represents the length of string and

The Pumping Lemma forRegular Languages p.8/39

represents the length of string and