Brs-rv-04-r8-0728 J

., '), ,, (\t
'-_J

B.Tech. Degree'IV Semester Examinotion Aprit 2018

CS 15: 1404 AUTOMATA LANGUAGES AND COMPUTATIONS
(2015 Spheme)

Time :3 Hours Maximum Marks: 60

PART A
(AtLsw er ALI questions)
-'= 20)

r. (a) Define deterministic finite autornata. Give an example. what is :l:

application?
(b) Define Moore and Mealy machines.
(c) What are regular expressions? Write regular expressions for
(i) Binary strings made of 5 bits and not ending with '01''
(ii) Strings from f = {a,b\ containing only three a's and zeto or more
b's.
(d) Draw NFA for the following regular expressions.
(i) (o+r)"oo(o+r)".
(ii) o. 1- o".
(e) Define context free grammar. Explain its two normal forms with an example
for each.
(fl Simplifr the follow'ing CFG. ,r;r...:g.-{ ,-l'+
(-*> /f-s%1..)9'-'l''--"\
S+a ABdloBC
*i:i
.

A-+aAlE
B->aBClb
C-+cClBlc
rB-a ^?C
,^{ZC\\
(l-)"a\^B''\L] c
iiai ,

(g) Explain Chomsky HierarchY.

(h) What is meant by Halting problem of Turing Machine?
Wit't'
(i) Discuss the closure properties of regular sets.
CI) Explain the model of a Push down Automata.
PART B ft
(4 x 10:40) u
/\
rn
II.
,1,
'r Y
U ,/
/-.
I t_'

-li* -Jt't
"{ :---j1,
-'tr!y'-/\ q\-.\
olt "U '\ rt
i ..' ,J "b-''
i, ,/'1,
^i,,
zy_..,

(b)
@@
What is meant by epsilon closure? Eliminate epsilon from the following
\i,-r'
NFS t*.-(a)

'\
and draw the NFA without ePsilon.
r ,(;!'
*tu-$|-gfio (q,i "1(1,,1)"
 m. (a) Minimize the following DFA.

,L
)
\(' Il*,*, 1i::

,L
(.,\' ')
,') t'
'l') (b) Design a Moore Machine to calculate the residue mod 4 of a binary str"ing (5)
L', \'7 treated as a binary integer.

rv. (a) State and prove the pumping lemma for regular sets, 'i (s)
(b) Show that the Languag (s)
o" ln >
L = {(r) t} is not regular. i
OR
V. (a) Using Ardens Theorem, find the regular expression for the following DFA. (s)
-
l,--'
-\)
't *J- I i* ^ " *
'd.-\L,
r
I

S___-/ il (1 L I
' r of"-
i,-r t) r-i-+ tr [,
L d'r" 1( 'r il))
;
lf
! rui Prove that for every regular expression 'r' there is an equivalent NFA'M'. (s)

VL_ (a) Define a Fush Down Automata. . Design a PDA to accept: the language (7)
1={o'rln>l} '7 ,'.tri'
(b) Consider the grammar (3)
S -+ ABIC
A-+ aAbIqb
.4
! B *+ cBdlcd -Z
C -+ aCdl aDd
)
D -+ bDclbc
Find the left most derivation and parse tree for the string 'aabbccdd',
OR
VII. (a) Convert the following CFG to Chomsky normal fonn (4)
t,.\ S -+ abBl abAl a
B -+ Bblb
A -+ aAla
/\, (b) Explain the three methods used to simplifu context free grammars. (4)
a (c) What is an ambiguous grammar? Give an example. (2)
L

VIII., (a) Explain the model of Turing machine.

'( (3)
'- (b) Design a Turing machine to accept the language - (7)
.J 7 = la'b' c'lr 1) . /
)

=
OR
[X. (a) Explain what you mean by: (31
(i) Multi+rack Turing machines.
'(ii) Multi-tape Turing maehines.
(iii) Uni'rersal Turing machines.
(b) What do you mean by recursive and recursively enumerable languages? (3)
(c) Design aTtirrngmachine to accept the Language r = oo(o + l). .
(4)

***