1253 . 4th Semester (CSE) Examination, December-2006 THEORY OF AUTOMATA AND COMPUTATION Paper-CSE-206-E, Time allowed : 3 hours Maximum marks : 100 Note: Attempt any five questions. Parts of a question must be attempted together 1. (@)_ “LetLbea set accepted by a Non-deterministic finite ‘Automaton then there exists a deterministic finite ‘Automaton that accepts L.” Prove it. 10 (b) Find a regular expression corresponding to each of the following subsets of {0, 1}* @ The language of all strings containing exactly two's. i) The language of all strings in which the number of O's is eyen. 10 2. (a) What are Mealy and Moore machines ? Let M,= {0, 5, A, S, ot, q,} be a Mealy machine. ‘Show that there is a Moore machine M, equivalent to M,. 10 (©) Convert Moore machine to equivalent Mealy M/c. Given: 10 Presentstate Nextstate Output a ye 0 a dy dy 0 % Qa : 1253-P-2-Q-8 (06) PTO.(2) 1253 3. (@) State and prove Myhill-Nerode Theorem for minimisation of finiteAutomata, 10 (b) Find CSG generating the language : 10 {SS/S € {a, b}*} 4. Whatdo youmean by Regular expression ? Let rbe aregular expression, then prove that there exists a NFA with € moves that accepts L (1). 20 5. (a) Design a Turing machine to accept the Language L={o"l"/n21}. 10 (©) Explain Chomsky hierarchy of grammar. What is relation between languages of classes ? 10 6. What is a Turing machine ? What are the advantages of ‘TM. over Finite state machine ? What is halting problem of ™M.? 10+10 7. Explain the following : @ Chomsky Normal Form (CNF) Gi) Difference between context free and context sensitive grammar Gi) Griebach normal form, 20 8 Write short notes on the following : (@ Universal Turing Machines (@) _Non-deterministic Turing Machines Gi) Linear Bounded Automata Gv) Context Sensitive Language. Sx4 1253