tib vg

USI{ 10css6
&rtp*m

Fifth Semester B.E. f)egree Exa m inationo f) ec. 2016 / J an.20l7

Formal Languages and Automata Theory
Time: 3 hrs. Max, Marks: 100
Note: Answer FIVE full questions, selecting
() ut leust TWO questions from euch purl.
()
O
d
k
A. PART -A
a. Define Finite automata. Write the application of finite automata. (05 Marks)
V)
d
.t, b. Design a DFA to accept the following language over the alphabet {0, 1}.
C)

C)
t<
i) l={{or)'.2,lit1irr}
8e
oo* ii) L = {o:lro lmod3 =lo lmod2 } (10 Marks)
Q:=
-v, c. What is NFA? Explain with example. (05 Marks)
dq,
E\n
oo
goo
ll
a. Define Regular expression. Find reg ular expression for the following languages.
.=
d$
c\
i) L -{u"b* : (m+ n)iseven}
hbo
YO
OC
ii)
Strings of a's and b's whose 3'd symbol from right is a. (05 Marks)
(1 C)
+-, Fl b. Consider the following €-NFA
a b
t< l<
o
c
8n
;'.*
---)p 0pqr
(f)
=
q p qr 0
U()
dO
*r q r 0p
b0c
i) Compute € -closure of each state
.s cq
vo
ii)Convert the automata to DFA (10 Marks)
}E
(5-l
c. Obtain an e -NFA for the regular expression a* + b* + c* (05 Marks)
€cs
}B a, If L and M are regular languages prove that LnM is also regular. (05 Marks)
5s
(Aa

O.A
b. Prove that the following language is not regular
(
trO.
5d
ogl
l= ,n
i0" Inisprime|
)
(05 Marks)
av
c.l=
c. Minimize the following DFA. (10 Marks)
5c)
r/) t+=

l<()

Ep
>, 1:
bo rJ
Fie Q3(c)
da0
C)=
a.U
tr
Ac,l
5:
o<
J c.i a. Define CFG. Write CFG for the language.
()
L - {o"t"ln > I } (06 Marks)
z
b. Consider the grammar
E-++EEl*EEl-EEl*ly
O.
F Find leftmost and rightmost derivation for the string .ut - xyxy and write parse tree.
(08 Marks)
c. Write the application of CFG. (06 Marks)

I of 2
 10css6

a.
,BEH,
DesignPDA forthe languag, L = {tlolela+U;- A n"(<o) = nu(cD) } sho* that ID's for the
string abbbaa and also write the transition diagram. (12 Marks)
b. Convert the CFG to PDA by empty stack.
I-+alblIallblI0lIl
E-+I|E*EIE+EI(E) (osMarks)

a. Elimin ate t, unit and useless production from the following grammar and put the resulting
grammar into CNF. (12 Marks)
g--+ABCIBaB
A -> aAlBaCl aaa
B---+ bBblalD
C --r CAIAC
D ---+ s
b. State and prove pumping lemma for CFG. (08 Marks)

a. With a neat diagrarn, explain the working of basic Turing machine (08 Marks)
b. Design TM to accept the language
L-{o"1"ln>t} (12 Marks)

Write short notes on :

a. Multitape Turing machine (05 Marks)
b. Halting problem in TM (05 Marks)
c. Post correspondence problem (05 Marks)
d. Recursive languages. (05 Marks)

:F****

2 of 2