Professional Documents
Culture Documents
for
Context-free Languages
A possible derivation:
A B E
e E
A a b S D
a e
b B d d
c c
Repeated
variable
Fall 2005 Costas Busch - RPI 4
Derivation Tree aabbccddee
S
A B E
e E
A a b S D
a e
b B d d
c c
Repeated
variable
Fall 2005 Costas Busch - RPI 5
B bSD bbBdD bbBdd
B
b S D
b B d d
*
B bbBdd
Fall 2005 Costas Busch - RPI 6
S ABE AaBE aaBE aaBeE aaBee
A B E
e E
A a
a e
*
S aaBee
Fall 2005 Costas Busch - RPI 7
B
c c
B cc
A B E
e E
A a b S D
a e
b B d d
c c
* *
S aaBee B bbBdd B cc
Fall 2005 Costas Busch - RPI 9
* *
S aaBee B bbBdd B cc
* *
0 0
S aaBee aaccee aa(bb) cc(dd ) ee
0 0
aa(bb) cc(dd ) ee L(G )
Fall 2005 Costas Busch - RPI 10
We have removed the middle part
S
A B E
c e E
A a c
a e
*
0 0
S aa(bb) cc(dd ) ee
* *
S aaBee aabbBddee
* *
2 2 2 2
aa (bb) B (dd ) ee aa (bb) cc(dd ) ee
2 2
aa(bb) cc(dd ) ee L(G )
Fall 2005 Costas Busch - RPI 12
We have repeated middle part two times
S
A B E
e E
A a b S D
a 1 b B d d
e
b S D
2 b B d d
c c
*
2 2
S aa(bb) cc(dd ) ee
Fall 2005 Costas Busch - RPI 13
* *
S aaBee B bbBdd B cc
*
3 3
S aa(bb) cc(dd ) ee L(G )
A B E
e E
A a b S D
a 1 b B d d
e
b S D
2 b B d d
b S D
3 b B d d
c c
*
3 3
S aa (bb) cc(dd ) ee
Fall 2005 Costas Busch - RPI 15
In General:
* *
S aaBee B bbBdd B cc
*
i i
S aa(bb) cc(dd ) ee L(G )
A B E
e E
A a b S D
a 1 b B d d
e
b S D
i b B d d
c c
*
i i
S aa (bb) cc(dd ) ee
Fall 2005 Costas Busch - RPI 17
From Grammar
And string
S ABE | bBd
A Aa | a aabbccddee L(G )
B bSD | cc
D Dd | d
E eE | e
(remove them)
Fall 2005 Costas Busch - RPI 19
Let r be the number of variables
We will show:
Some variable
H
Is repeated
Fall 2005 Costas Busch - RPI 22
Proof of Claim:
We will show that the tree of w
Has at least one path with r 2 nodes
t nodes
2
Level 2: t nodes
t nodes t nodes
2 nodes
t
At most
r 1 i : t i nodes
Level
Levels
Level r : t r nodes
r
However we took, | w | m t 1
Contradiction!!!
Vr 1
symbol
Fall 2005 Costas Busch - RPI 28
Since there are at most r different variables,
some variable is repeated
V1 S
V2
H
V3 Pigeonhole
principle
H
Vr 1
END OF PROOF
Fall 2005 Costas Busch - RPI 29
Take now a string w with | w | m
S
H
Some variable H
is repeated
H
subtree
yield u z yield
H
yield v y yield
H
u , v, x, y , z :
Strings of terminals x yield
Fall 2005 Costas Busch - RPI 31
Example: S
A B E
e E
A a b S D
e
u aa a b B d d
u v y z
v bb c c
x cc x
y dd B corresponds to H
z ee
Fall 2005 Costas Busch - RPI 32
Possible derivations S
S uHz
u z
H
H vHy
v y
H
Hx
x
Fall 2005 Costas Busch - RPI 33
Example: u aa
S
v bb
A B E
x cc
e E
A a b S D y dd
e
a b B d d z ee
c c B corresponds to H
S uHz H vHy H x
* *
S aaBee B bbBdd B cc
Fall 2005 Costas Busch - RPI 34
S uHz H vHy Hx
*
0 0
S uHz uxz uv xy z L(G )
* *
1 1
S uAz uvAyz uvxyz uv xy z L(G )
* *
S uHz uvHyz uvvHyyz
*
2 2
uvvxyyz uv xy z L(G )
* *
S uHz uvHyz uvvHyyz
* *
3 3
uvvvHyyyz uvvvxyyyz uv xy z L(G )
i i
we also know that uv xy z L(G )
For all i 0
L(G ) L {}
i i
uv xy z L
Fall 2005 Costas Busch - RPI 40
Observations: S
| vy | 1
Since there are u z
H
no unit or
-productions
v y
H
subtree
| vxy | m
x
Since no variable is
repeated in any path
in subtree
Fall 2005 Costas Busch - RPI 41
The Pumping Lemma:
For any infinite context-free language L
there exists an integer m such that
Context-free languages
n n
{a b : n 0}
m m m
We pick: wa b c
m m m
wa b c
i i
uv xy z L for all i0
Fall 2005 Costas Busch - RPI 49
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m
Case 1: vxy is within a
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 51
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 52
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
2 2
Case 1: From Pumping Lemma: uv xy z L
k 1
mk m m
aaaaaa...aaaaaa bbb...bbb ccc...ccc
u 2 2 z
v xy
Fall 2005 Costas Busch - RPI 54
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
2 2
Case 1: From Pumping Lemma: uv xy z L
k 1
2 2 m k m m
However: uv xy z a b c L
Contradiction!!!
Fall 2005 Costas Busch - RPI 55
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m
Case 2: vxy is within b
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 56
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 57
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m
Case 3: vxy is within c
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 58
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 59
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m m
Case 4: vxy overlaps a and b
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 60
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
2 2
Case 4: From Pumping Lemma: uv xy z L
k1 k 2 1
m k1 m k2 m
aaa...aaaaaaa bbbbbbb...bbb ccc...ccc
u 2 2 z
v xy
Fall 2005 Costas Busch - RPI 63
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
2 2
Case 4: From Pumping Lemma: uv xy z L
k1 k 2 1
2 2 m k1 m k2 m
However: uv xy z a b c L
Contradiction!!!
Fall 2005 Costas Busch - RPI 64
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
2 2
Case 4: From Pumping Lemma: uv xy z L
k1 k 2 k 1
m k1 k 2 mk m
aaa...aaaaabbaabb bbbbbbb...bbb ccc...ccc
u 2
v xy 2 z
Fall 2005 Costas Busch - RPI 67
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
2 2
Case 4: From Pumping Lemma: uv xy z L
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!!!
Fall 2005 Costas Busch - RPI 68
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m m
Case 5: vxy overlaps b and c
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 71
n n n
L {a b c : n 0}
m m m
wa b c
w uvxyz | vxy | m | vy | 1
m m m
aaa...aaa bbb...bbb ccc...ccc
u vxy z
Fall 2005 Costas Busch - RPI 72
There are no other cases to consider