Regulation : R09/R10

Code No: CS305

VIGNAN UNIVERSITY :: VADLAMUDI - 522 213

Vignans Foundation for Science, Technology and Research (Estd. U/s 3 of UGC Act of 1956)

III B.Tech I Semester Supplementary Examination, July 2013

THEORY OF COMPUTATION
(CSE)

Time: 3 hours Instructions: 1. Answer ONE question from each unit 2. All Questions carry equal marks 3. Assume missing data, if any ***

Max. Marks : 60

UNIT I 1. a) Give the different between NFA and DFA. [4M] b) If the alphabet is English language alphabet, then construct DFA for the following set of strings. [8M] {auto, break, int, if, do, else, enim, ant, ball, iron, ice} (OR) 2. Indentify the language accepted by the following DFA any minimize DFA. a q1 q1 q1 q1 q1 b q2 q3 q2 q4 q2 Q0 is initial state Q4 is final state [4+8M]

q0 q1 q2 q3 q4

UNIT II 3. a) Constant right linear grammar and/left-linear grammar for the language. L = {anbm/ n 2, m 3} b) State and prove pumping linear for regular languages. (OR) 4.

[6M] [6M]

a) Give the diff between mealy machine and Moore Machine and convert the following mealy machine to moore machine. [8M] b) Give decision properties of regular languages. [4M]

UNIT III 5. a) Give the definition of contact free Grammar and write CFG for the following language. [6M] L= {W WR /WE{0, 1}} Where WR is reverse f W. b) Give the definition of derivation Tree. Construct leftmost derivation Tree and Right most derivation Tree for the world id + id* id+ id E E+E/ E*E/id = Where {+, *, id} [6M] (OR)
1 of 2

Regulation : R09/R10

Code No: CS305

6.

a) Why should we simplify the grammars and wrote the difference between CNF and GNF. [4M] b) Convert the following grammar into Greibach Normal / Form. S AA/0 A SS/1 [8M]

UNIT IV 7. Give the definition of Push-down automata (PDA) and find the CFG that generates the language accepted by the PDA. [12M] M = ({q0 , q1 , q2 }, {a, b}{ A, Z }, , q0 , z , {q2 }) with transitions.

( q0 , a, z ) = { ( q0 , Az )} ( q 0 , a, A) = { ( q 0 , A) } ( q0 , b, A) = { ( q 0 , E )}

( q1 , t , z ) = { ( a 2 , E ) }

(OR) 8. Construct PDA for the language L = {a i b j c k / i j (or ) j k } [12M]

UNIT V 9. a) Explain the Modified post correspondence problem with an example. b) Give the definition of unrestrictic / Grammar Write UG for the language. L = an / n 1 (OR)

[4M] [8M]

10.

a) Give the definition of Turing machine are give its instantaneous description (ID). b) Construct Turing Machine for the following language L = {a are +ve integers.
b

/ whileb 1adna 1 and b

[6M] [6M]

2 of 2