Session 28

The Pumping Lemma
for
Context-Free Languages
1
CREATED BY K. VICTOR
The Pumping Lemma:
For infinite context-free language L
there exists an integer m such that
for any string w  L, | w | m

we can write w  uvxyz
with lengths | vxy | m and | vy | 1
and it must be:
i i
uv xy z  L, for all i  0 2
Applications
of
The Pumping Lemma
3
Non-context free languages
n n n
{a b c : n  0}
Context-free languages
n n
{a b : n  0}
4
Theorem: The language
n n n
L  {a b c : n  0}
is not context free
Proof: Use the Pumping Lemma

for context-free languages
5
n n n
L  {a b c : n  0}
Assume for contradiction that L

is context-free
Since L is context-free and infinite

we can apply the pumping lemma
6
n n n
L  {a b c : n  0}
Pumping Lemma gives a magic number m

such that:
Pick any string w L with length | w | m
m m m
We pick: wa b c
7
n n n
L  {a b c : n  0}
m m m
wa b c
We can write: w  uvxyz

8
n n n
L  {a b c : n  0}
m m m
wa b c
w  uvxyz | vxy | m | vy | 1
Pumping Lemma says:
i i
uv xy z  L for all i0
9
n n n
L  {a b c : n  0}
m m m
wa b c
We examine all the possible locations

of string vxy in w
10
n n n
L  {a b c : n  0}
m m m
wa b c
m
Case 1: vxy is within a
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z 11
n n n
L  {a b c : n  0}
m m m
wa b c
Case 1: v and y consist from only a
m m m
u vxy z 12
n n n
L  {a b c : n  0}
m m m
wa b c
Case 1: Repeating v and y

k 1
mk m m
aaaaaa...aaaaaa bbb...bbb ccc...ccc
u 2 2 z
v xy 13
n n n
L  {a b c : n  0}
m m m
wa b c
2 2
Case 1: From Pumping Lemma: uv xy z  L
k 1
mk m m
aaaaaa...aaaaaa bbb...bbb ccc...ccc
u 2 2 z
v xy 14
n n n
L  {a b c : n  0}
m m m
wa b c
2 2
k 1
2 2 m k m m
However: uv xy z  a b c L
Contradiction!!!
15
n n n
L  {a b c : n  0}
m m m
wa b c
m
Case 2: vxy is within b
m m m
u vxy z 16
n n n
L  {a b c : n  0}
m m m
wa b c
Case 2: Similar analysis with case 1
m m m
u vxy z 17
n n n
L  {a b c : n  0}
m m m
wa b c
m
Case 3: vxy is within c
m m m
u vxy z 18
n n n
L  {a b c : n  0}
m m m
wa b c
m m m
u vxy z 19
n n n
L  {a b c : n  0}
m m m
wa b c
m m
Case 4: vxy overlaps a and b
m m m
u vxy z 20
n n n
L  {a b c : n  0}
m m m
wa b c
Case 4: Possibility 1: v contains only a

y contains only b
m m m
u vxy z 21
n n n
L  {a b c : n  0}
m m m
wa b c

k1  k 2  1 y contains only b
m  k1 m  k2 m
aaa...aaaaaaa bbbbbbb...bbb ccc...ccc
u 2 2 z
v xy 22
n n n
L  {a b c : n  0}
m m m
wa b c
2 2
k1  k 2  1
m  k1 m  k2 m
aaa...aaaaaaa bbbbbbb...bbb ccc...ccc
u 2 2 z
v xy 23
n n n
L  {a b c : n  0}
m m m
wa b c
2 2
k1  k 2  1
2 2 m  k1 m  k2 m
However: uv xy z  a b c L
Contradiction!!! 24
n n n
L  {a b c : n  0}
m m m
wa b c
Case 4: Possibility 2: v contains a and b

y contains only b
m m m
u vxy z 25
n n n
L  {a b c : n  0}
m m m
wa b c
Case 4: Possibility 2: v contains a and b

k1  k 2  k  1 y contains only b
m k1 k 2 mk m
aaa...aaaaabbaabb bbbbbbb...bbb ccc...ccc
u 2
v xy 2 z 26
n n n
L  {a b c : n  0}
m m m
wa b c
2 2
k1  k 2  k  1
m k1 k 2 mk m
aaa...aaaaabbaabb bbbbbbb...bbb ccc...ccc
u 2
v xy 2 z 27
n n n
L  {a b c : n  0}
m m m
wa b c
2 2
However: k1  k 2  k  1
2 2 m k1 k 2 m  k m
uv xy z a b a b c L
Contradiction!!! 28
n n n
L  {a b c : n  0}
m m m
wa b c

y contains a and b
m m m
u vxy z 29
n n n
L  {a b c : n  0}
m m m
wa b c

y contains a and b
Similar analysis with Possibility 2
30
n n n
L  {a b c : n  0}
m m m
wa b c
m m
Case 5: vxy overlaps b and c
m m m
u vxy z 31
n n n
L  {a b c : n  0}
m m m
wa b c
m m m
u vxy z 32
There are no other cases to consider
(since | vxy | m , string vxy cannot

m m m
overlap a , b and c at the same time)
33
In all cases we obtained a contradiction
Therefore: The original assumption that

n n n
L  {a b c : n  0}
is context-free must be wrong
Conclusion: L is not context-free

34
More Applications
of
The Pumping Lemma
35
The Pumping Lemma:
For infinite context-free language L
there exists an integer m such that
for any string w  L, | w | m

we can write w  uvxyz
and it must be:
i i
uv xy z  L, for all i  0 36
n n n
{a b c : n  0} {vv : v {a, b}}
n n R
{a b : n  0} {ww : w  {a, b}*}
37
L  {vv : v {a, b}*}
is not context free

38
L  {vv : v {a, b}*}
is context-free

39
L  {vv : v {a, b}*}
such that:
Pick any string of L with length at least m
m m m m
we pick: a b a b L
40
L  {vv : v {a, b}*}
m m m m
We can write: a b a b  uvxyz
Pumping Lemma says:
i i
41
L  {vv : v {a, b}*}
m m m m
a b a b  uvxyz | vxy | m | vy | 1

m m m m
of string vxy in a b a b
42
L  {vv : v {a, b}*}
m m m m
m
Case 1: vxy is within the first a
k1 k2
va ya k1  k 2  1
m m m m
a ...... a b ...... b a ...... a b ...... b
u vx y z
43
L  {vv : v {a, b}*}
m m m m
m
k1 k2
va ya k1  k 2  1
m  k1  k 2 m m m
a ................ a b ...... b a ...... a b ...... b
u v2 x y2 z
44
L  {vv : v {a, b}*}
m m m m
m
m  k1  k 2 m m m 2 2
a b a b  uv xy z  L
k1  k 2  1
45
L  {vv : v {a, b}*}
m m m m
m
m  k1  k 2 m m m 2 2
2 2
However, from Pumping Lemma: uv xy z  L
Contradiction!!! 46
L  {vv : v {a, b}*}
m m m m
m
Case 2: v is in the first a
m
y is in the first b
k1 k2
va yb k1  k 2  1
m m m m
a ...... a b ...... b a ...... a b ...... b
u v x y z 47
L  {vv : v {a, b}*}
m m m m
m
m
y is in the first b
k1 k2
va yb k1  k 2  1
m  k1 m  k2 m m
a ............ a b ............ b a ...... a b ...... b
u v 2 x
y 2 z 48
L  {vv : v {a, b}*}
m m m m
m
m
y is in the first b
m  k1 m  k 2 m m 2 2
k1  k 2  1
49
L  {vv : v {a, b}*}
m m m m
m
m
y is in the first b
m  k1 m  k 2 m m 2 2
2 2
Contradiction!!! 50
L  {vv : v {a, b}*}
m m m m
m m
Case 3: v overlaps the first a b
m
y is in the first b
k1 k 2 k3
v a b yb k1, k 2  1
m m m m
a ...... a b ...... b a ...... a b ...... b
u v xy z 51
L  {vv : v {a, b}*}
m m m m
m m
m
y is in the first b
k1 k 2 k3
v a b yb k1, k 2  1
m k2 k1 m  k3 m m
a ...... a b ... b a ... a b ......... b a ...... a b ...... b
u v 2 x y 2 z 52
L  {vv : v {a, b}*}
m m m m
m m
m
y is in the first b
m k 2 k1 m  k3 m m 2 2
a b a b a b  uv xy z  L
k1, k 2  1
53
L  {vv : v {a, b}*}
m m m m
m m
m
y is in the first b
m k 2 k1 k3 m m 2 2
a b a b a b  uv xy z  L
2 2
Contradiction!!! 54
L  {vv : v {a, b}*}
m m m m
m
Case 4: v in the first a
m m
y Overlaps the first a b
Analysis is similar to case 3
m m m m
a ...... a b ...... b a ...... a b ...... b
uv x y z 55
Other cases: m m m m
vxy is within a b a b
or
m m m m
a b a b
or
m m m m
a b a b
Analysis is similar to case 1:

m m m m
a b a b 56
More cases: m m m m
vxy overlaps a b a b
or
m m m m
a b a b
Analysis is similar to cases 2,3,4:
m m m m
a b a b
57
There are no other cases to consider
Since | vxy | m, it is impossible

vxy to overlap: m m m m
a b a b
nor
m m m m
a b a b
nor
m m m m
a b a b 58
L  {vv : v {a, b}*}


59
n n n
{a b c : n  0} {ww : w  {a, b}}
n!
{a : n  0}
n n R
{a b : n  0} {ww : w  {a, b}*}
60
n!
L  {a : n  0}
is not context free

61
n!
L  {a : n  0}

is context-free

62
n!
L  {a : n  0}

such that:
m!
we pick: a L
63
n!
L  {a : n  0}
m!
We can write: a  uvxyz
Pumping Lemma says:
i i
64
n!
L  {a : n  0}
m!
a  uvxyz | vxy | m | vy | 1

m!
of string vxy in a
There is only one case to consider

65
n!
L  {a : n  0}
m!
m!
a ............... a
u v x y z
k1 k2 1  k1  k 2  m
va ya
66
n!
L  {a : n  0}
m!
m! k1  k 2
a ........................... a
u v2 x y2 z
k1 k2 1  k1  k 2  m
va ya
67
n!
L  {a : n  0}
m!
m! k k  k1  k 2
a ........................... a
u v2 x y2 z
k1 k2 1 k  m
va ya
68
n!
L  {a : n  0}
m!
m! k 2 2
a  uv xy z
1 k  m
69
Since 1  k  m , for m  2 we have:
m! k  m! m
 m! m!m
 m!(1  m)
 (m  1)!
m! m! k  (m  1)!

70
n!
L  {a : n  0}
m!
m! m! k  (m  1)!
m! k 2 2
a  uv xy z  L
71
n!
L  {a : n  0}
m!
2 2
m! k 2 2
a  uv xy z  L
Contradiction!!! 72
We obtained a contradiction

n!
L  {a : n  0}

73
n n n
{a b c : n  0} {ww : w  {a, b}}
n2 n n!
{a b : n  0} {a : n  0}
n n R
{a b : n  0} {ww : w  {a, b}*}
74
n2 n
L  {a b : n  0}
is not context free

75
2
n n
L  {a b : n  0}
is context-free

76
2
n n
L  {a b : n  0}
such that:
m2 m
we pick: a b L
77
2
n n
L  {a b : n  0}
2
m m
We can write: a b  uvxyz
Pumping Lemma says:
i i
78
2
n n
L  {a b : n  0}
2
m m
a b  uvxyz | vxy | m | vy | 1
of string vxy in m2 m
a b
79
2
n n
L  {a b : n  0}
2
m m
m
Most complicated case: v is in a
m
y is in b
2 m
m
a ..................... a b ...... b
u v x y z
80
2
n n
L  {a b : n  0}
2
m m
k1 k2
va yb 1  k1  k 2  m
2 m
m
a ..................... a b ...... b
u v x y z
81
2
n n
L  {a b : n  0}
2
m m
Most complicated sub-case: k1  0 and k 2  0

k1 k2
va yb 1  k1  k 2  m
2 m
m
a ..................... a b ...... b
u v x y z
82
2
n n
L  {a b : n  0}
2
m m

k1 k2
va yb 1  k1  k 2  m
2
m  k1 m  k 2
a ............... a b ... b
u 0 x 0z
v y 83
2
n n
L  {a b : n  0}
2
m m

k1 k2
va yb 1  k1  k 2  m
m 2  k1 m  k 2 0 0
a b  uv xy z
84
k1  0 and k 2  0 1  k1  k 2  m
2 2
(m  k 2 )  (m  1)
2
 m  2m  1
2
 m  k1
2 2
m  k1  (m  k 2 )
85
2
n n
L  {a b : n  0}
2
m m
2 2
m  k1  (m  k 2 )
2
m  k1 m  k 2 0 0
a b  uv xy z  L
86
2
n n
L  {a b : n  0}
2
m m
0 0
2
m  k1 m  k 2 0 0
a b  uv xy z  L
Contradiction!!! 87
When we examine the rest of the cases
we also obtain a contradiction
88

2
n n
L  {a b : n  0}

89
SELF ASSESSMENT QUESTIONS
Q.1. Which of the following statements is true about
Pushdown Automata (PDA)?
a) PDA can only recognize regular languages.
b) PDA can recognize context-free languages but not context-
sensitive languages.
c) PDA can recognize context-free languages and some
context-sensitive languages.
d) PDA can recognize any recursively enumerable language.
Answer: c) PDA can recognize context-free languages and some
context-sensitive languages.
Q.2 In a PDA, the stack serves the purpose of:
a) Storing the input symbols.
b) Storing the current state of the automaton.
c) Providing additional memory for computation.
d) Determining the next transition of the automaton.
Answer: a c) Providing additional memory for
computation.
Q.3 Which of the following is a limitation of a deterministic PDA
(DPDA) compared to a non-deterministic PDA (NPDA)?
a) DPDA can recognize a larger class of languages.
b) DPDA cannot recognize any context-free languages.
c) DPDA can only recognize regular languages.
d) DPDA cannot recognize languages with nested structures.
Answer: d) DPDA cannot recognize languages with nested

structures.
TERMINAL QUESTIONS
Q.1. Explain the concept of pushdown automata (PDA) and its
key components.
Q.2.Describe the process of accepting a string by a pushdown
automaton. How does the PDA handle the interactions
between the input string and the stack?
Q.3.Discuss the difference between deterministic
pushdownautomata (DPDA) and non-deterministic pushdown
automata (NPDA). How do they differ in terms of language
recognition and the behavior of the stack?
94

Session 28

Uploaded by

Document Information

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

Session 28

Uploaded by

Copyright:

Available Formats

The Pumping Lemma

for any string w  L, | w | m

Proof: Use the Pumping Lemma

Assume for contradiction that L

Since L is context-free and infinite

Pumping Lemma gives a magic number m

Pick any string w L with length | w | m

We can write: w  uvxyz

with lengths | vxy | m and | vy | 1

Pumping Lemma says:

We examine all the possible locations

Case 1: v and y consist from only a

Case 1: Repeating v and y

Case 2: Similar analysis with case 1

Case 3: Similar analysis with case 1

Case 4: Possibility 1: v contains only a

Case 4: Possibility 1: v contains only a

Case 4: Possibility 2: v contains a and b

Case 4: Possibility 2: v contains a and b

Case 4: Possibility 3: v contains only a

Case 4: Possibility 3: v contains only a

Similar analysis with Possibility 2

Case 5: Similar analysis with case 4

(since | vxy | m , string vxy cannot

Therefore: The original assumption that

Conclusion: L is not context-free

for any string w  L, | w | m

Proof: Use the Pumping Lemma

Since L is context-free and infinite

Pick any string of L with length at least m

with lengths | vxy | m and | vy | 1

Pumping Lemma says:

We examine all the possible locations

Analysis is similar to case 3

Analysis is similar to case 1:

Analysis is similar to cases 2,3,4:

Since | vxy | m, it is impossible

Therefore: The original assumption that

L  {vv : v {a, b}*}

Conclusion: L is not context-free

Proof: Use the Pumping Lemma

Assume for contradiction that L

Since L is context-free and infinite

Pumping Lemma gives a magic number m

Pick any string of L with length at least m

with lengths | vxy | m and | vy | 1

Pumping Lemma says:

We examine all the possible locations

There is only one case to consider

m! m! k  (m  1)!

m! m! k  (m  1)!

Therefore: The original assumption that

Conclusion: L is not context-free

Proof: Use the Pumping Lemma

Since L is context-free and infinite

Pick any string of L with length at least m

with lengths | vxy | m and | vy | 1

Pumping Lemma says:

We examine all the possible locations

Most complicated sub-case: k1  0 and k 2  0

Most complicated sub-case: k1  0 and k 2  0

Most complicated sub-case: k1  0 and k 2  0

Therefore: The original assumption that

Conclusion: L is not context-free