Beruflich Dokumente
Kultur Dokumente
com
MCA
THEORY EXAMTNATTON (SEM-rr) 2016-17
INTRODUCTION TO AUTOMATA TIIEORY & LANGUAGES
Time : 3 Hoilrs Max, lllarlrs : 70
Note : Be precise in youF onswer,
SECTION: A
Atternpt all questions. 7x2=14
a) Define DFA using diagram.
b) Define rnealy machitle.
c) Define context free grammar with an exarnple.
d) Define regular grammar with an example.
e) Define Push down Autornata.
f) What are the special features of Turing machine {TM)?
g) Define Post Correspondence Problem?
SECTION.B
Attempt any five questions. 5x7=$$
(a) Construct a Mealy Machine to equivalent Moore machine which is given below -
www.aktuonline.com
Next State
Present lnput a = 0 Input a = I
State State Output State Output
aQt Qt t Qz 0
4z Q+ I Q* 1
Qs Qz t Qt 1
Q+ Qs
0 4t 1
Qo Qa Qe
Qt Qz Qs
Qz Qs Q+
Qz Qo 4s
Q* Qo Qd
cls 4t Q+
tlt Qs
www.aktuonline.com
www.aktuonline.com
(h)showthatthecont€xtnee$ammarGgrvenbyproduction s -) sBs/8 , B -) b, is
ambiguous.
SECTION.C
Attempt any two questions. Each question corry r0.5 marks
2x10.s=2r
3. Show that the halting problem of Turing Machine is undecideble
www.aktuonline.com 'rL {