Scribd
Upload
263 views

Exercise04 PDF

The document contains an exercise sheet for a theoretical computer science course. It includes 4 exercises on topics like context-free grammars, Chomsky normal form, and pushdown automata. Exercise 1 involves constructing grammars for DFAs and checking for ambiguity. Exercise 2 analyzes the language accepted by a sample PDA. Exercise 3 requires building a PDA for a specific context-free language. Exercise 4 asks students to create a PDA for another given language.

Uploaded by

compiler&automata
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
263 views

Exercise04 PDF

The document contains an exercise sheet for a theoretical computer science course. It includes 4 exercises on topics like context-free grammars, Chomsky normal form, and pushdown automata. Exercise 1 involves constructing grammars for DFAs and checking for ambiguity. Exercise 2 analyzes the language accepted by a sample PDA. Exercise 3 requires building a PDA for a specific context-free language. Exercise 4 asks students to create a PDA for another given language.

Uploaded by

compiler&automata
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Theoretical Computer Science (Bridging Course)

Dr. G. D. Tipaldi University of Freiburg


F. Boniardi Department of Computer Science
Winter semester 2014/2015

Exercise Sheet 4
Due: 27th November 2014

Exercise 4.1 (Context-free grammars, Chomsky normal form)


(a) Construct a context-free grammar for the following DFA:

1 0
1

q0 0 q1 q2
0
1

Solution:
The language of the DFA is defined by the grammar G = (V, , R, S0 ) with V = {S0 , S1 , S2 },
= {0, 1}, and R being the following set of rules:
S0 0S1 | 1S0
S1 0S2 | 1S0
S2 0S2 | 1S0 | 

(b) Show that the grammar ({S}, {a, b}, R, S) with rules R = S aS | aSbS |  is ambiguous.
Solution:
Consider the string aab. We can give two different leftmost derivations of this string: S
aS aaSbS aabS aab and S aSbS aaSbS aabS aab.
(c) Give a grammar in Chomsky Normal Form that generates the same language as the grammar
G = (V, , R, S) with V = {S, X, Y }, = {a, b, c}, and R being the following set of rules:
S XY
X abb | aXb | 
Y c | cY

Solution:
Using the algorithm from the lecture, we get the grammar G0 = (V 0 , , R0 , S) with V =
{S, X, X1 , X2 , Y, A, B, C}, = {a, b, c}, and R0 being the following set of rules:

S0 S
S XY
X abb | aXb | 
Y c | cY

S0 S
S XY | Y
X abb | aXb | ab
Y c | cY
S0 S
S XY | c | cY
X abb | aXb | ab
Y c | cY

S0 S
S XY | c | cY
X aX1 | aX2 | ab
X1 bb
X2 Xb
Y c | cY

S XY | c | CY
X AX1 | AX2 | AB
X1 BB
X2 XB
Y c | CY
Aa
Bb
Cc

Exercise 4.2 (Pushdown Automata)


Consider the following PDA:

q4 q6

c, x 
a,  x a,  y a, y  b, y y
c, x x

,  $ ,   d,   ,   , $ 
q0 q1 q2 q3 q5 q7

(a) Show that the PDA accepts the word aaadbabacc.


Solution:
(aaadbabacc, q0 , )
(aaadbabacc, q1 , $)
(aadbabacc, q1 , x$)
(aadbabacc, q2 , x$)
(adbabacc, q2 , yx$)
(dbabacc, q2 , yyx$)
(babacc, q3 , yyx$)
(abacc, q4 , yyx$)
(bacc, q3 , yx$)
(acc, q4 , yx$)
(cc, q3 , x$)
(cc, q5 , x$)
(c, q6 , x$)
(, q5 , $)
(, q7 , ).

(b) Which language L does the given PDA accept?


Solution:
L = {an as d(ba)s c2n {a, b, c, d} | n, s 0}

Exercise 4.3 (Pushdown Automata)


Create a PDA that recognizes the following context free language:

L = {a wck | w {a, b} and k = |w|a (k = the number of as in w)}

Solution:

a,  a
a,   b,   c, a 

,  $ ,   ,   , $ 
q0 q1 q2 q3 q4

Exercise 4.4 (Pushdown Automata)


Create a PDA that recognizes the following language.

L = {ai bj ck | i, j 0, k = i + j}

Solution:
c, a 
a,  a b,  b c, b 

,  $ ,   ,   , $ 
q0 q1 q2 q3 q4

You might also like