se QP Code :12552 3 Hours) [Total Marks (1) Question No. 1 is compulsory. (2) Attempt any three questions out of remaining five questions. (3) Assumptions made should be clearly stated. (4) Figures to the right indicate full marks. (5) Assume suitable data wherever required but justify the same. N.B.: Give chomsky hierarchy of grammar with examples, }) State and explain auy 5 closure properties of reguiar languages. (©) Compare recursive and recursively enumerable languages. (d) State and prove equivalence of NFA and DFA. 2. (@) Design a DFA to accept strings over the alphabet set {a,b} that begin with ‘aa but not end with ‘aa’. (b) Convert (0 +2) (1 0)* ( €+ 1) into NFA with ¢-moves and hence obtain a DFA. 3. (a) Design a MOORE and MEALY machine to decrement a binary number. (0) Give statement of pumping lemma for regular sets and hence prove that {we w| We (a+ b)*} is not regular where w® is reverse of w. 4. (@) Obtain leftmost derivation, rightmost derivation and derivation tree fbr the string "cecbaccba". The grammar is S$ S8a| Sb] ¢ (b) Design Turing machine as generator to add two binary numbers and hence simulate for"110 + 10”. Hint : Assume two way infinite tape. 5. (a) Design a PDA te accept language { a! b2"*!| n> 1}. (b) Convert the bofow given grammar to Chomsky Normal Form (CNF) and Griebach Nermal Form (GNF) E> EEl|E*E| (| id Consider "id" as a single terminal/symbol. 6. (a) Design a Turing machine as acceptor for the language {a b™)n, m> 0 and m2 n} (i) Design PDA to check even parentheses over £ = {0,1} ©N-C0n.111504-14, ishivia :80 wu 10 10 10 0 10 10 10 10 10