More Problems on

Push Down Automaton

1
 Problems
# 4:
Design a NPDA to accept the following Language:

L(M) = { anb2n , n ≥ 0 }

2
 Time - 0
Input String

a a b b b b

$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

3
 Time - 1
Input String

a a b b b b

$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

4
 Time - 2
Input String

a a b b b b

0
0
$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

5
 Time - 3
Input String

a a b b b b 0
0
0
0
$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

6
 Time - 4
Input String

a a b b b b 0
0
0
0
$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

7
 Time - 5
Input String

a a b b b b
0
0
0
$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

8
 Time - 6
Input String

a a b b b b

0
0
$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

9
 Time - 7
Input String

a a b b b b

$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

10
 Time - 8
Input String

a a b b b b

“Accept”

$
a,  00 b,0  
Stack

,   q b,0   q ,$ $

q1 q4
2 3

11
 Problems
# 5:
Design a NPDA to accept the following Language:

L(M) = { wcwR, w{a,b}* }

12
 L(M) = { wcwR, w{a,b}* }

a,   a a, a  
b,   b b, b  

q0 c,   q1 , $  $ q2
13
Execution Example: Time 0
Input
a b c b a
$
Stack
a,   a a, a  
b,   b b, b  

q0 c,   q1 , $  $ q2
14
 Time 1
Input
a b c b a
a
$
Stack
a,   a a, a  
b,   b b, b  

q0 c,   q1 , $  $ q2
15
 Time 2
Input
b
a b c b a
a
$
Stack
a,   a a, a  
b,   b b, b  

q0 c,   q1 , $  $ q2
16
 Time 3
Input
b
a b c b a
a
$
Stack
a,   a a, a  
b,   b b, b  

q0 c,   q1 , $  $ q2
17
 Time 4
Input
b
a b c b a
a
$
Stack
a,   a a, a  
b,   b b, b  

q0 c,   q1 , $  $ q2
18
 Time 5
Input
a b c b a
a
$
Stack
a,   a a, a  
b,   b b, b  

c,   , $  $ q2
q0 q1
19
 Time 6
Input
a b c b a
$
Stack
a,   a a, a  
b,   b b, b  
accept
q0 c,   q1 , $  $ q2
20
 Problems
# 6:
Design a NPDA to accept the following Language:

L(M) = { anbmcn+m , n0, m0 }

21
 L(M) = { anbmcn+m , n0, m0 }

a,$  0$
a,0  00 b,1  11

b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 22
Input String
Time 0
a a b c c c

a,$  0$
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 23
Input String
Time 1
a a b c c c

a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 24
Input String
Time 2
a a b c c c

0
a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 25
Input String
Time 3
a a b c c c
1
0
a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 26
Input String
Time 4
a a b c c c
1
0
a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 27
Input String
Time 5
a a b c c c

0
a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 28
Input String
Time 6
a a b c c c

a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c,


2 3 1

$


,
c,0  c,1  
  q c,0  
4 29
Input String
Time 7
a a b c c c

a,$  0$ 0
a,0  00 b,1  11 $
Stack
b,$  1$
q5
,  $ q b,0  10 q
q1

$
c, accept


2 3 1

$


,
c,0  c,1  
  q c,0  
4 30
 Problems
# 6:
Design a NPDA to accept the following Language:

L(M) = { anbn+mcm , n0, m1 }

31
Input String
Time 0
a a b b b c

$
Stack
a,   0 b,0   b,   0 c,0  

b,0  b,$  0$ c,0  

q1 q2 q3 q4

,
$

$
q5
32
Input String
Time 1
a a b b b c

0
$
Stack
a,   0 b,0   b,   0 c,0  

b,0  b,$  0$ c,0  

q1 q2 q3 q4

,
$

$
q5
33
Input String
Time 2
a a b b b c
0
0
$
Stack
a,   0 b,0   b,   0 c,0  

b,0  b,$  0$ c,0  

q1 q2 q3 q4

,
$

$
q5
34
Input String
Time 3
a a b b b c
0
0
$
Stack
a,   0 b,0   b,   0 c,0  

b,0  q b,$  0$ q c,0   q

q1

,
$
2 3 4


$
q5
35
Input String
Time 4
a a b b b c

0
$
Stack
a,   0 b,0   b,   0 c,0  

b,0  q b,$  0$ q c,0   q

q1

,
$
2 3 4


$
q5
36
Input String
Time 5
a a b b b c

0
$
Stack
a,   0 b,0   b,   0 c,0  

b,0  q b,$  0$ q c,0   q

q1

,
$
2 3 4


$
q5
37
Input String
Time 6
a a b b b c

0
$
Stack
a,   0 b,0   b,   0 c,0  

b,0  q b,$  0$ q c,0   q

q1

,
$
2 3 4


$
q5
38
Input String
Time 7
a a b b b c

$
Stack
a,   0 b,0   b,   0 c,0  

b,0  q b,$  0$ q c,0   q

q1

,
$
2 3 4


$
“Accept” q5
39
 Problems
# 7:
Design a NPDA to accept the following Language:

L(M) = { a3bncn , n0}

40
 L(M) = { a3bncn , n0}

a,    a,   
qc qb qa

a,  

b,  b c, b  

b,  b c, b    , $  $
q0 q1 q2 q3
41
Representation of PDA
By
Flow chart Structure

42
Shapes & Notations:

Start Reject Accept

Read Push Pop

43
Example:
Design a PDA that accepts the Language
L = {anbn , n0}
By flow chart method

44
Start

b
Accept
Read

a b $
a 
Push a Pop Read Pop

$ a a

Reject Reject Reject

45
# 7:
Design a NPDA to check the well-formedness
of parenthesis in the given string.

46
 Start

(
( )
Read Pop
 $
Push (
( Reject
Pop
$
Reject
Accept

47