Total No.

of Printed Pages:3
SUBJECT CODE :- 114
FACULTY OF ENGINEERING AND TECHNOLOGY
T.E.(CSE/IT) Examination Nov/Dec 2015
Theory of Computation
(Revised)
[Time: Three Hours] [Max. Marks: 80]

m
“Please check whether you have got the right question paper.”
N.B i) Q.No.1 and Q.No.6 are compulsory.
ii) Attempt any two questions from Q.No.2 to Q.No5 and two questions from Q.No.7 to Q.No.10 of each section.
iii) Figures to the right indicate full marks.
SECTION-A

.co
Q1. Attempt any five from the following 10
1) Define deterministic finite automata with suitable example
2) Determine the regular expression or language given by the following finite automata.
a

q0 a, b
q1

3)
4)
5)
6)
7)
8)
b
Define derivation tree in CFG

Define CFG. Give an example. ine

Explain closure properties of regular expressions

Define mealy machine and more machine

Find the regular expression for the set of strings over {0, 1} with exactly two OS.
Define null closure of set of states in NFA with null moves.
ng
Q.2 a) Construct a DNA equivalent to the MDFA whose transition diagram is given by following fig. 08

a,b a, b
q1 q3
q0
b
ue

b a

q2 q4
a 07

b) Construct a more machine which is equivalent to the mealy machine described by the following transition
diagram.
m

0/y
P0
0/n

q0 1/n 0/n
Ba

1/n
P1

Q.3 a) Construct FA for the given regular expression: 08

𝑟 = 01 + (01)∗
b) Convert the given NFA to equivalent DFA. 07

K-2015

ac4fd94faaab640f273021ebf8423dad
 States/𝜖 a b
→ 𝑞0 {𝑞0 , 𝑞1 } {𝑞2 }
𝑞1 {𝑞0 } {𝑞1 }

m
𝑞2 - {𝑞0 , 𝑞1 }

Q.4 a) Construct a minimum state automation equivalent to a DFA whose transition table is defined by following 08
table.

.co
States a b
→ 𝑞0 𝑞1 𝑞2
𝑞1 𝑞4 𝑞3
𝑞2 𝑞4 𝑞3
𝑞3 𝑞5 𝑞6
𝑞4 𝑞7 𝑞6

ine
𝑞5 𝑞3 𝑞6
𝑞6 𝑞6 𝑞6
𝑞7 𝑞4 𝑞6

b) Consider the grammar:

𝑠 → 𝑠𝑏𝑠/𝑎.show that this is an ambiguous grammar. For the string abababa, find out:
07
i) Parse trees
ng
ii) Leftmost derivation
iii) Rightmost derivation

Q.5 Write short notes on 15

i) Applications of IA.
ii) Pumping lemma for regular language
iii) Chomsky classification of languages
ue

SECTION-B
Q.6 Attempt any five questions from the following 10
1) Deterministic PDA.
2) Explain the two normal forms for CFG.
3) State the application of TM.
4) Define unit production and null production in CFG.
m

5) Explain the component of PDA with neat diagram

6) Define the language of a PDA.
7) What is halting problem of TM?
8) Define instantaneous description for TM.
Ba

Q.7 a) Convert the following grammar into CNF: 08

𝑠 → 𝑎 𝐴𝐷, 𝐴 → 𝑎𝐵/𝑏𝐴𝐵,
𝐵 → 𝑏, 𝐷 → 𝑑.
b) Construct a PDA A equivalent to the following context –free grammar: 07
𝑠 → 𝑂𝐵𝐵, 𝐵 → 𝑂𝑆/𝐼𝑆/𝑂.test whether 0104 is in N(A)

K-2015

ac4fd94faaab640f273021ebf8423dad
Q.8 a) Design a Turing machine to recognize all strings consisting of an even number of is 08
b) Show that 𝐿 = {𝑎𝑝 |𝑃 𝑖𝑠 𝑝𝑟𝑖𝑚𝑒 } is not context free. 07

Q.9 a) Explain deterministic PDA. How does it differ from non deterministic PDA? 08

m
b) Explain in detail the model of linear bounded automata 07

Q.10 Write short notes on 15

1) Halting problem of TM
2) Decision problem in CFL

.co
3) PDA and acceptance by PDA.

ine
ng
ue
m
Ba

K-2015

ac4fd94faaab640f273021ebf8423dad