EJ E

,Yd qIYJ E
m

USN

Fifth Sernester B.E.

Automata Theory and, "gprh putabi I ity
Time: 3 hrs. Max. Marks: 100

c)
,9
Note: Answer any"FIW futl questions. *. 'r'
9 .:.-

la .
. i.i

o- Define the following terms w[th""ii'b amples alphabet, powers an alphabet string, of
string concatenation and languages;., (10 Marks)
U)

.o
b . Define DFSM. Design a DIrSM to accept each of the following languages:
O
(c i) :
L {W€ {0.1}- : W'is ending with 011} ,,,ir.

L:
()

E R.
t<
ii) {We {0.1}. .iir.,::
ihas
odd nutnbers of a's ahd even numbers of b's} (10 Marks)

o.;=
v,3 a. Convert the followin$'NDFSM to DFSM:
5'n 6 t ,,. a b c
oo ll
coo -+p d'., tq) {r}
.= '{p}
cgtc-l q tB')** {q} {r}
:-r bl
0
Y() X<f
{'q} {r} 0 tp)
-()
d)C
EE 'to"l't'' (10 Marks)
L9- '# ,r'*;,.
o>
8s b. Define.'distinguishable and Indistiu$ti{shable states. Miuirmite the following DFSM.
6 a b.
(t) d
6:a
-+A B E
.J(l)
.<
(co l< B tr fl
b0s 't$, A C
(ccd
li r- ..'p.,,,,,1 rc G
>>p
acc
(tr
Ec3
-t ,* Ej H F
5 o.r ,'F C G
te
U)* G G E
o-a
tro. FI G Ci
x(6
()i :.ti,,,',, ., .,,,,.,... ..;;i, u (l0Marks)
? .9, :rl
6* '' i.
a. Defrne Regular expressffir,SVrite the regularpxpression for the following languages:
'.r

,'i) ' To accept stringsofia's and b's suc'h' tthird symbol fromthe right is'a'and
A,E
6E
s- (J
fourth
5,v
>'!
,i symbol from [Link] is'b'.
co0 iD 4, ffi < 3 }
1- == {anbt,,,,I'l',}' (10 Marks)
()= b. Build a regular e-Xpression from the"fbllowing FSM (Finite State Machine). (06 Marks)
sd) .r,,.:. q.
tr>
()-
=6J
l2
C ). b
U< ls-,....-
;oi \
6) \
z
o
\rf, /"
tv ri,,
P
o git,i
o. .ill|ti1: . .U'

'i, Fig.Q.3(b)
...lat,
*
c. Write an equiva,Llent NDFSM for the following regular expression a(a + b*;*b. (04 Marks)

I of2
18CS54

4 a. Show that regular languages are closed under complement adintersection. (10 Marks)
b. State and prove pumping lemma theorem for regular la'[Link]{il r$Cs. And show that the language
;- {WWR : W€ {0, 1}- is not regular}. (10 Marks)

5 a. Define CFG (Context Free Grammar). Design CFG'for'in. languages.

i) *
L - to2n 1'ln t= 0, >= o)
iD L={oilj2kli-iorj-p} -,.";, (10 Marks)
i ,. ,,:i1,,,,,.
b. Define Ambiguity. Is the following grammar ambiguous? Give reasoh, =
S [Link]
-+ ,ir,,,

c-+b (10 Marks)

, .t. . ,'t'
6 a. Define CNF (Chomsky Norffilftrm). Convert the tbllowin$ CFG to CNF,
S + aACa, A + Bla, B,',,,, |Ut; C -+ '... (10 Marks) cCle
,
b. Define PDA (Push p-,offi4;rAutomata). Design a ?Dn to accept the following language,
; - {anbn : n >:0}., 'ihw the transition diagram''for the constructed PDA. Show the ID's
for the string aaab'h,b-" (10 Marks)
"
'',. "ii" ,t.
7a. Define a Tur.in5i Mbchine. Explain the woiking of a Turing Machine. (08 Marks)
b. Design ar,$U, e Machine to accept L;.{0"1"2"|n t- 0}. Draw the transition diagrarn. Show
the mo$t.'$l ade for string 0011 2?,;ii:
ji sij,,.. (12 Marks)
'
,,
,,!,[Link]
u"ri,,'' , '''
8a. Design a TM for addition of 2 nurfrbers (2 + 3) withffi$ition
'trlti't
[Link] ID fcirthe same.
ii i.
" , (14 Marks)
::.::r::,
b. Define and differentiate.B-l,M and NDTM. ,,,. '',.,,". ., ,: 106 Marks)
..t
i-
,::i.

9a. Explain post coffespondence problem.,,,i,i,''ii (08 Marks)

b. Explain Halting,p,rpbl"bm in Turing Machihe' (08 Marks)
c. Write a note onnplqurch Turing HypotheSlsl (04 Marks)
'"',i,iiii.,'::.:i .,ir,
;:\.
10 a. Explain three,variants of Turing M'de$ine. (12 Marks)
b. Write . on Quantum Co_yffition. (08 Marks)
?,'
*****(
',.....',,.i"'il
.,,,i'

2 of 2