Total No. of Questions: 5l SEAT No.

P-1305 [Total No. of Pages : 2

i'

[60551-306"
T.Y. B.Sc.
qOMFUTERSCIENCE
CS - 356" i Thb6retical computer science
(2ry1.9 Patttfrn) (CBCS) (Semester - V)
Time: 2 HoursJ 'o: :.i [Mux. Marks : 35
Instructions to the candidates:
I) All qubstions are compulsory
2) Fi.go4.,res ts.the right indicate fall marks.
\,.\
QI) Attempt.flry Bight of the foltowing: (out of TEN) [8x1=8]
a) Wrjte output function i" of Moore and Mealy machines.
b) List all the proper prefixes of the pt nd'"ABCb'.
c) DefineNullablesymbol. ,:,:"' ..:="
d) Give formal definition of Puffiwn Auiomata.
e) Definerightlineargtrammaq,,;. ." .-J
0 State True or False. DFA'{ nq"t,,have multiple final states.
g) Name the type of la$guiigeagcepted by Turing Machine.
h) Write the tuples of LBA. . ''' .,.-
D State true or false. p ihg lemma is used to show that language ig riot
context foee. ...... ,

;
j) Write smallestpossible string acceptedbythe following;,€E$.r1ar,e.,5pression.
...," iJ 1"r '"i
10+(0+11)0*1 a__ .,,,4.
:
a:\?
. ,, ,i.

"t 1 ., I
:' lJa('l
Q2) Attempt any four of the following : [4 x 2:8]
;*,,"" "...q
a) Explain Reduction with the help of examplelrl1*a
::'
b) Construct FA for regular expression. ,,,,-"".."' ''.'''
\i'i::"\
.,
'1
11 f "" jr:
.

(ol+lo)*+
c) DifferentiatebetweenDFAandNFA. .".'

PT,O.
 \

'-1.s

d) Write down the e -closure of each state fiorn the following FA.

'"-'i .-. "'r '

-'j, t a- .r- i' " l, ,-I:"

\r. -

e) Define types efTuringMachine.

t'
ttt.
'..

... .:
.,,
:

Qj) Attempt any::two of thi following : (Out of THREE) 12 x 4:81

a) Construif a D'FA for a language over I: {0,1 }
Llr-.il.2
Ll :,.!gll strings starting with '0') _'
L2 = { 11 strings not having'01' as substring) t.'

b) Construct the following CFG int Norynal Foqn(CNn;

, .-' ..,'.
c) Construct TM which accepts the language that start with 0 and ends with 1.

Q4) Lttempt any two of the following : (Out of THREE) t2 x 4:81

a) Conskuct a PDA for @E ggage ; : {a"b' lr>:1}
b) Construct a Mealy lnachine for the language L over E : {0, 1} which
outputs 'A if it has sqlt'string'101'. it outputs 'B'if it has substring
'110', otherwise it outputs 'C'. .==i'

c) Write a short note on Chomsky's hierarchy. :" !

-.-i'"nt,., ,"-
.- '" ,_:i;::':
Q5) Attempt any one of the following : (Out of TWO} '
:::.::::::.:.:.:=

t.," [1 x 3
: 3]
,) Construct a Moore machine over alphabet {0,'1,} io g-e,t'l;s compliment of
,,. ,ru..,,

b) Show that L : {0'1n I n>:1} is not regular. ,_,,.'.,

J( .E

[60ss]-306