CcornPS) (Eerrn-g) Ccg (Qq)

T^ G,
Paper I Subject Code: 31901 / Theorl' of Conrputer Science [UoV -2oL"

Duration: 3hrs Ii\Iax Niarks:1101

N.B. (l)Qucstion No. I is compulsory.
(2) Atternpt anv three out of rernaining fir'c questions.
13) Assurrip-rtions liade should be clearly statcd.

l. (a) Explain Chomsky Hie rarchy. 5

(b) Discuss Pumping lernnra lor regular la:rguagcs r.r'ith suitablc exarnple. 5
(c) Dcscribe rrariants of Tunng lvlachines. 5
(d) Obtain the rcgular erprcssions for the follou,ing langna-ucs over I:{0,1}: 5
(i) All strings of 0's & I's but not having thrcc corisccr.rtive 0's.
(ii) All strings of 0's & I's rvith even nunrl-rer of 0's and l's.

2. (a) Conr'ert the follou'ing grammar into GNF: 10

S -> AACD, A +aAb I e. C +aC i a. D -+aDa i bDb I e
(b) Design a Turing ivlachine to check for eqrral number t-;la's and b s
o.'er I: {r.bi. t0
n
(a) Constrr;ct a PDA eqr"rivalent tc the tbllo'ving gralrmlar: l0
S-+ 0Yl0l, X+ 0Yl0X. Y-+ 0ll
(b) Converl rhe follou,ing RE to e -NFA & then convcrt ir to DFA:
*0) 0l
10* l+ I 10

4. (a) Construct NFA rvithout e ior the follou,inge -NFA: l0

1.2 I 1.2

(b) Find Lcftmost derivation" Rightmost derivation arrd drarv Parsc tree for the
follolving gramnlar. Also clieck if dre granltrar is anrbiguoLls or not: l0
S-+aXbX, X-+aYlbYle , \'-+Xlciz

5. (a) Design a Turing Machine for the subtraction ol trvo positive integers (rn ,n) in
unary representation: if (m>n). ourtput X; else if (rn<n.), olrtput Y; elsc cutput Z on
the tape. l0
(b) Determine it there is a solution using PCP, for given tu,o lists of strings A and B:
,{:{00,001.1000}. B:{0.ll,Ull}. 10

6. Write short notes tln any TWO: 20

(a) Mealy ivlacirines (b) Arden's Theorem
(c) Dccidability & undccidability (d) Applications of FA

13191 Page 1 of 1

AB22FD F6 FF764326E703 F5 E3 5 DD_5 7,s,\ -5