Scribd
Upload
1 views

TOC-TECSE-DEC14

question paper

Uploaded by

Sushil Kulkarni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

TOC-TECSE-DEC14

question paper

Uploaded by

Sushil Kulkarni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

[Total No .

o f Pri n t ed Pa g es : __2__] CODE NO:- U-116


FACULTY OF ENGINEERING& TECHNOLOGY
Third Year (CSE/IT) Examination-Dec-2014
Theory of Computation (Revised)
[Time: THREE Hours] [Max. Marks: 80]
“Please check whether you have got the right question paper.”

m
N.B 1) Q. no 1 and 6 are compulsory
2) Attempt any two questions from Q. No 2 to Q .no 5 and from Q. no. 7 to Q. no 10 of each
section.
3) Figures to the right indicate full marks.
SECTION A

.co
Q.1 Attempt any five from the following 10
a) Define NFA with epsilon transitions. Give suitable example.
b) Describe the sets for (a+b)* and (a+b) + state the difference in the two sets.
c) Define ardeus theorem and state it significance in finite automata
d) Define mealy machine with example.
e) What is the relation between finite automata and regular expressions?

e
f) Define derivation tree in CFG.
g) Define CFG and CFh with example.
h) Distinguish between NFA with epsilon transitions and NFA without epsilon transitions.
Q.2
gin
a) Define ambiguity in CFG. Prove that the given grammar is ambiguous. 08

b) Using pumping lemma show that is not regular language. 07


Q.3 a) Construct Moore machine equivalent to Mealy machine given below. 08
en

Present state Next state O/P Next state O/P


0 0
1 0
1 1
1 0
07
b) Convert the given NFA to equivalent DFA
mu

State ԑa b
{ } { }
{ { }
- { }
Q.4 a) Minimize the following DFA 08
States ԑ 0 1
Ba

b) Find regular expression for the language over {0, 1}* with set of strings beginning with 07
substring 00. Construct finite automation with the help of regular expression.

Page 1 of 2
6136abda993afc8b85c52d700b140dca
Q.5 Write short notes on. 15
i) Chomsky hierarchy
ii) Applications of FA
iii) Structural representation of FA.
SECTION B
Q.6 Attempt any five questions from the following. 10
a) Define CNF and GNF.
b) What are possibilities of a TM when processing an input string?
c) Explain the two methods of acceptance of string by PDA.

m
d) Define unit production and null production in CFG.
e) What is the main application of pumping lemma in CFL
f) Define turingmarline.
g) State and explain any two properties of CFL.
h) Eliminate null productions from the following grammar

.co
Q.7 a) Construct PDA for the following grammar. 08

b) Show that is not context free Language. 07

e
Q.8 a) Consider the grammar below and convert it into Chomsky normal form.
gin 08

07
b) Explain the model of linear bounded automata also state how is LBA different from TM.
Q.9 a) Explain deterministic push down automata. How does it differ from non
deterministicPDA?
b) Design a Turing machine over {1, b} which can compute a concatenation function over∑
. If a pair of words (w1, w2) is the input, the output has been w1w2.
Q.10 a) Explain halting problem of Turing machine with suitable diagram. 08
b) Construct PDA for the language given below. 07
en
mu
Ba

Page 2 of 2
6136abda993afc8b85c52d700b140dca

You might also like