[a 4 24266 B. Tech. Sth Semester (F) Scheme (CSE) Examination, December-2018 "THEORY OF AUTOMATA AND. COMPUTATION | Paper-CSE-305-F Time allowed : 3 hours] [Maximum marks: 100 Note: Question No. 1 is compulsory. Attempt five | ‘questions in total selecting one question from each i of the four sections. | 1. @) Whatare imitations of FSM? Sx (©) Define DFA.nd NDFA mathematically. (©) Define Decidablity. (Define PCP. (©) Define Computability Section-A 2 (a) For the following non-deterministic finite automata, make equivalent deterministic finite automata, 10,10 24266-P-3-0-9 (18) PTO.@) 24266 () Prove that regular sets are closed under concatenation, 3. What are Mesly/Moore machines ? Explain, can these machines work like one another ? If yes, then explain with an example to convert Moore to Mealy machine. 20 Section-B 4. (@) What do you mean by Pumping Lemma ‘and applications of pumping Lemma ? Using that ‘concept of pumping lemma prove thatthe language L=lepeine) 146 (©) What do you mean by ambiguity ? How do you ‘mean to say a grammar is ambiguous ? (2) What do you mean by Reduced form of a CFG ? ‘Explain with example, 812 (©) Whatare normal forms of CFG ? Explain convert ACFG into CNF, S + AACD, A> aAbla, D> aDa | BDb Id coace, 24266 a 24266 Section-C 6 Construct PDA accepting {a" "aI m,n 21} by null store. Construct the comesponding CFG accepting same set, 20 7. (a) Design a'TM for subtraction for mn, where m> rand both m,n 10,10 (©) Write short note on Halting Problem of TM. Sectiow-D. 8. What are Primitive Recursive Functions ? Explain ‘nd prove that the following functions are primitive recursive : (1) Transpose (11) Concatenation (it) Union. 20 ‘9, Write and briefly explain the characteristics ofeach class of grammar classified according to Chonisky bierarchyDetermine the type of grammar G () SaA,A>aAB, B>bASa Gi) S>aAB,AB—>C,A>b,B9AB, 24266