Class12 13

Courtesy Costas Busch - RPI 1
NPDAs Accept
Context-Free Languages
(12-13)
Instantaneous Description
) , , ( s u q
Current
state
Remaining
input
Current
stack
contents
3
Properties of Instantaneous Description
If an ID sequence is a legal computation for
a PDA, then so is the sequence obtained by
adding an additional string at the end of
component number two.
) , , ( ) , , (
) , , ( ) , , (
*
*
F E
F E
yw p xw q
y p x q
P
P
H
H
4
a PDA, then so is the sequence obtained by
adding an additional string at the bottom of
component number three.
) , , ( ) , , (
) , , ( ) , , (
*
*
FK EK
F E
y p x q
y p x q
P
P
H
H
5
a PDA, and some tail of the input is not
consumed, then removing this tail from all
ID's result in a legal computation sequence.
) , , ( ) , , (
) , , ( ) , , (
*
*
F E
F E
y p x q
yw p xw q
P
P
H
H
Languages of PDA
Acceptance by Final State
Language of NPDA : M
F q
q Z w q w M L
f
f
)} , , ( ) , , ( : { ) (
0 0
E P H
Initial state
Final state
) (M L
) , , , , , , (
0 0
F Z q Q M H + 7 !
7
Languages of PDA
Acceptance by Empty Stack
Language of NPDA : M
)} , , ( ) , , ( : { ) (
0 0
P P q Z w q w M N
! H
Initial state
Any state
) (M L
) , , , , , , (
0 0
F Z q Q M H + 7 !
8
From Empty Stack to Final State
) , , , , , (
0 0
Z q Q P
N
H + 7 !
F
P
If of some PDA ) (
N
P N L !
Then there is a PDA such that
) (
F
P L L !
9
From Empty Stack to Final State
Proof: Let
10
Property # 2
11
Then there is a PDA such that
From Final State to Empty Stack
) , , , , , , (
0 0
F Z q Q P
F
H + 7 !
N
P
If for some PDA
) (
F
P L L !
) (
N
P N L !
12
From Final State to Empty Stack
Proof: Let
13
from Property # 2 of ID
Context-Free
Languages
(Grammars)
Languages
Accepted by
NPDAs
!
Theorem:
Context-Free
Languages
(Grammars)
Languages
Accepted by
NPDAs
_
Proof - Step 1:
Convert any context-free grammar
to a NPDA with:
G
M
) ( ) ( M L G L !
Context-Free
Languages
(Grammars)
Languages
Accepted by
NPDAs
_
Proof - Step 2:
Convert any NPDA to a context-free
grammar with:
G
M
) ( ) ( M L G L !
Converting
Context-Free Grammars
to
NPDAs
Proof - step 1
to an NPDA automaton M
We will convert any context-free grammar
G
Such that:
M
Simulates leftmost derivations of
G
. . . . .
m k
V V V S
2 1 2 1
o o o
/
. .
1
o
2
o
k
o
1 + k
o
$
1
V
2
V
m
V
Input
processed
Stack
contents
: G
: M
Input
Stack
leftmost variable
Leftmost derivation
Simulation of derivation
n
S o o o . . . .
2 1

. .
1
o
2
o
n
o
$
: G
: M
Input
Stack
Leftmost derivation
Simulation of derivation
string of terminals
end of input is reached
An example grammar:
P p
p
p
p
T
Ta T
b S
aSTb S
What is the equivalent NPDA?
q
0
q
1 2
q
S p P P,
P, $ p$
Grammar:
NPDA:
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P p
p
p
p
T
Ta T
b S
aSTb S
P
P
p
p
b b
a a
,
,
Grammar:
P p
p
p
p
T
Ta T
b S
aSTb S
A leftmost derivation:
abab abTab abTb aSTb S
0
q
q
1 2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b
Time 0
b
Derivation:
q
0
q
1 2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
S
Time 0
Derivation:
S
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
a
b
S
T
q
1
Time 1
Derivation:
aSTb S
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
a
b
S
T
q
1
Time 2
aSTb S
Derivation:
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
b
T
b
q
1
Time 3
Derivation:
abTb aSTb S
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
b
T
b
q
1
Time 4
Derivation:
abTb aSTb S
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
b
T
a
q
1
Time 5
Derivation:
abTab abTb aSTb S
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
b
T
a
q
1
Time 6
Derivation:
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
b
a
q
1
Time 7
Derivation:
q
0
2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
b
q
1
Time 8
Derivation:
q
0
q
1 2
q
S p P P,
P, $ p$
P P
P
P
P
p
p
p
p
T
Ta T
b S
aSTb S
,
,
,
,
P
P
p
p
b b
a a
,
,
Input
Stack
$
a
a
b b
accept
Time 9
Derivation:
In general:
Given any grammar
G
We can construct a NPDA
M
With ) ( ) ( M L G L !
}) { $, , , , , }, , , ({
2 0 2 1 0
q q T V T q q q M H !
) , , , ( P S T V G !
Constructing NPDA from grammar :
q
0
q
1 2
q
S p P P,
P, $ p$
w Ap , P P p a a,
M
For any production
w Ap
For any terminal
a
G
Grammar generates string
G
w
if and only if
NPDA accepts
M
w
) ( ) ( M L G L !
Therefore:
For any context-free language
there is a NPDA
that accepts the same language
Context-Free
Languages
(Grammars)
Languages
Accepted by
NPDAs
_
Note: From CFG to PDA accepting by
emptying stack
Given any grammar
G
We can construct a NPDA
M
With
) ( ) ( M N G L !
) , , , ( P S T V G !
) , , , , }, ({ S q T V T q M H !
Constructing NPDA from grammar :
q
w Ap , P P p a a,
M
For any production
w Ap
For any terminal
a
G
Converting
NPDAs
to
Context-Free Grammars
Proof - step 2
For any NPDA M
we will construct
a context-free grammar with
G
) ( ) ( G L M L !
Intuition:
G
The grammar simulates the machine
A derivation in Grammar :
Current configuration in NPDA M
- - - - . abc ABC abc S
Input processed Stack contents
terminals variables
From NPDA to CFG
Lets look at how a PDA can consume
and empty the stack.
We shall define a grammar with variables of the
form [p
i-1
Y
i
p
i
] that would represent going from p
i-1
to p
i
with the net effect of popping Y
i
.
k
x x x x .
2 1
!
45
Q s r rYs pXr a qZs Z a q XY p
Q r pYr a qZr Z a q Y p
a qZp Z a q p
p
p
p
, : ] ][ [ ] [ ) , , ( ) , (
: ] [ ] [ ) , , ( ) , (
] [ ) , , ( ) , (
H
H
H I
) , , ( ) , , (
*
0
I I p Z w q
o
H
To generate all those strings
w that cause P to pop Z
0
from
its stack while going from q
0
to p.
47
48
} ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], {[
0 0 0 0
S q pZ p pZ pXq pXp p qZ q qZ qXp qXq V !
49
Some Necessary Modifications
Modify (if necessary) the NPDA
(accepting by reaching final state) so that:
1) The stack is never empty
2) It has a single final state
and empties the stack when it accepts a string
3) Has transitions in a special form
1) Modify the NPDA so that
the stack is never empty
$
Stack
a
OK
$
OK NOT OK
$
a
$
Introduce the new symbol to denote
the bottom of the stack
#
$
a
#
$
#
#
Original NPDA
# , p P P
At the beginning push into the stack
#
original
initial state
new
initial state
i
q
j
q
b a p $ ,
i
q
j
q
b a p # ,
In transitions:
replace every instance of with $
#
Example:
if the automaton attempts to pop
or replace it will halt
$
Convert all transitions so that:
i
q
j
q
s p \ o,
i
q
j
q
x x p , P s p \ o,
{$} + x
Convert transitions as follows:
halting state
NPDA
f
q
P P p x ,
Empty the stack
{$} + x
2) Modify the NPDA so that
it empties the stack
and has a unique final state
Old final states
P P p $ ,
3) modify the NPDA so that
transitions have the following forms:
i
q
j
q
P o p B ,
OR
i
q
j
q
CD B p , o
symbols stack : , , D C B
i
q
j
q
y p P o,
Convert:
i
q
j
q
t t o y p ,
{$} + t
i
q
j
q
B Ap , o
Convert:
i
q
j
q
XB Ap , o P o p X ,
{$} + X
symbols
i
q
j
q
By Ap , o
Convert:
i
q
j
q
y Ap , o BX X p , o
{$} + X
symbols
2 | | > y
Convert recursively
P P p $ ,
0
q
f
q
a, $ p0$
a, 0 p00
a, 1p P
b, $ p1$
b, 1p11
b, 0 p P
} : { ) (
b a
n n w M L ! !
Example of a NPDA in correct form:
symbol stack initial : $
The Grammar Construction
) (
j i
Bq q
In grammar : G
Terminals:
Input symbols of NPDA
states
Stack symbol
Variables:
i
q
j
q
P p B a,
For each transition
We add production
a Bq q
j i
p ) (
For each transition
We add productions
) )( ( ) (
k l l j k i
Dq q Cq q a Bq q p
i
q
j
q
CD B a p ,
For all possible states
in the automaton
l k
q q ,
Start Variable:
) $ (
f o
q q
Stack bottom symbol
Start state
final state
Example:
P P p $ ,
0
q
f
q
a, $ p0$
a, 0 p00
a, 1p P
b, $ p1$
b, 1p11
b, 0 p P
a q q p ) 1 (
0 0
Grammar production:
Example:
P P p $ ,
0
q
f
q
a, $ p0$
a, 0 p00
a, 1p P
b, $ p1$
b, 1p11
b, 0 p P
) $ )( 1 ( | ) $ )( 1 ( ) $ (
) $ )( 1 ( | ) $ )( 1 ( ) $ (
0 0 0 0 0
0 0 0 0 0 0 0 0
f f f f f
f f
q q q q b q q q q b q q
p
p
Grammar productions:
Example:
P P p $ ,
0
q
f
q
a, $ p0$
a, 0 p00
a, 1p P
b, $ p1$
b, 1p11
b, 0 p P
Grammar production:
P p ) $ (
0 f
q q
) $ )( 1 ( | ) $ )( 1 ( ) $ (
) $ )( 1 ( | ) $ )( 1 ( ) $ (
0 0 0 0 0
0 0 0 0 0 0 0 0
f f f f f
f f
p
p
) 1 )( 1 ( | ) 1 )( 1 ( ) 1 (
) 1 )( 1 ( | ) 1 )( 1 ( ) 1 (
0 0 0 0 0
0 0 0 0 0 0 0 0
f f f f f
f f
p
p
) $ )( 0 ( | ) $ )( 0 ( ) $ (
) $ )( 0 ( | ) $ )( 0 ( ) $ (
0 0 0 0 0
0 0 0 0 0 0 0 0
f f f f f
f f
q q q q a q q q q a q q
p
p
Resulting Grammar:
able start vari : ) $ (
0 f
q q
) 0 )( 0 ( | ) 0 )( 0 ( ) 0 (
) 0 )( 0 ( | ) 0 )( 0 ( ) 0 (
0 0 0 0 0
0 0 0 0 0 0 0 0
f f f f f
f f
p
p
b q q
a q q
p
p
) 0 (
) 1 (
0 0
0 0
P p ) $ (
0 f
q q
Derivation of string
abba
) $ (
0 f
q q ) $ )( 0 (
0 0 0 f
q q q q a
) $ (
0 f
q q ab
) $ )( 1 (
0 0 0 f
q q q q abb
) $ (
0 f
q q abba abba
In general:
w Aq q
j i
) (
if and only if
the NPDA goes from to
by reading string and
the stack doesnt change below
and then is removed from stack
i
q
j
q
A
A
w
Therefore:
w q q
f
) $ (
0
if and only if
w is accepted by the NPDA
Therefore:
For any NPDA
there is a context-free grammar
that accepts the same language
Context-Free
Languages
(Grammars)
Languages
Accepted by
NPDAs
_
Deterministic PDA
DPDA
Deterministic PDA: DPDA
q
1
q
2
w b a p ,
1
q
2
q
w b p , P
Allowed transitions:
(deterministic choices)
Allowed transitions:
q
1
q
2
1
, w b p P
q
3
2
, w c p P
q
1
q
2
1
, w b a p
q
3
2
, w c a p
(deterministic choices)
q
1
q
2
1
, w b a p
q
3
2
, w b a p
Not allowed:
(non deterministic choices)
q
1
q
2
1
, w b p P
q
3
2
, w b a p
DPDA example
a, P p a
b, a p P
q
0
q
1
q
2
q
3
b, a p P
P, $ p$
} 0 : { ) ( > ! n b a M L
n n
a, P p a
} 0 : { ) ( > ! n b a M L
n n
The language
is deterministic context-free
Definition:
A language is deterministic context-free
if there exists some DPDA that accepts it
L
Example of Non-DPDA (NPDA)
P, $ p$
q
1
q
2
b b
a a
p
p
P
P
,
,
P, P pP
q
0
P
P
p
p
b b
a a
,
,
} { ) (
R
ww M L !
P, $ p$
q
1
q
2
b b
a a
p
p
P
P
,
,
P, P pP
q
0
P
P
p
p
b b
a a
,
,
Not allowed in DPDAs
NPDAs
Have More Power than
DPDAs
Deterministic
Context-Free
Languages
(DPDA)
Context-Free
Languages
NPDAs
_
Since every DPDA is also a NPDA
It holds that:
We will actually show:

We will show that there exists
a context-free language which is not
accepted by any DPDA
L
L
L
Deterministic
Context-Free
Languages
(DPDA)
Context-Free
Languages
(NPDA)
The language is:
} { } {
2n n n n
b a b a L !
0 > n
We will show:
L
is context-free
L
is not deterministic context-free
} { } {
2n n n n
b a b a L !
Language is context-free L
Context-free grammar for : L
2 1
| S S S p
P |
1 1
b aS S p
P |
2 2
bb aS S p
} {
n n
b a
} {
2n n
b a
} { } {
2n n n n
b a b a
} { } {
2n n n n
b a b a L !
is not deterministic context-free
Theorem:
The language
(there is no DPDA that accepts ) L
Proof:
Assume for contradiction that
} { } {
2n n n n
b a b a L !
is deterministic context free
Therefore:
there is a DPDA that accepts M L
DPDA with M
n n
b a
n
b
accepts
n n
b a
2
accepts
n n
b a
} { } { ) (
2n n n n
b a b a M L !
DPDA with M
n n
b a
n
b
} { } { ) (
2n n n n
b a b a M L !
Such a path exists because of the determinism
M
The language
is not context-free
} {
n n n
c b a
(we will prove this at a later class using
pumping lemma for context-free languages)
act 1:
Regular languages
* *b a
Context-free languages
n n
b a
The language
is not context-free
} {
n n n
c b a L
}) { } { (
2n n n n
b a b a L !
Fact 2:
(we can prove this using pumping lemma
for context-free languages)
We will construct a NPDA that accepts:
} {
n n n
c b a L
}) { } { (
2n n n n
b a b a L !
which is a contradiction!
Modify M
M
'
n
c
n n
c a
} { } { ) (
2n n n n
b a b a M L !
} { } { ) (
2n n n n
c a c a M L !
'
Replace
with
b
c
n n
b a
n
b
M
The NPDA that accepts
} {
n n n
c b a L
n n
b a
n
b
n
c
M
'
M
n n
c a
P P
Connect final states of
with final states of
M
'
M
Since is accepted by a NPDA } {
n n n
c b a L
it is context-free
Contradiction!
(since is not context-free) } {
n n n
c b a L
Therefore:
} { } {
2n n n n
b a b a L !
There is no DPDA that accepts
End of Proof
Not deterministic context free

Class12 13

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Class12 13

Transféré par

Droits d'auteur :

Formats disponibles

Courtesy Costas Busch - RPI 1

We will actually show:

Vous aimerez peut-être aussi