BTS(C)-IV— 08-013-B B. Tech Degree IV Semester Examination, April 2008 CS 403 AUTOMATA LANGUAGES AND COMPUTATION (2002 Scheme) Time : 3 Hours, Maximum Marks : 100 L (@) Define NFA and DFA. Give one example for each, (19 (&) Show that for a given NFA there is an equivalent DFA. (10) OR UL (a) Give the Deterministic finite Automata accepting the following language} over the Alphabet {0,1} Z (10) @ the set of all strings which has at most two 0°s. Y Gi) the set of all strings which has even number of 0's and 1° (b) Show that NFA’s with without € -moves are equivalent. (10) It. (a) Construct the finite automata equivalent to the following regular expression. @ — 10+(0+11)071 GOLA GOy' +11)" +071. 2) (©) Show that L = {a" : P is a prime number} isnot regular. 8) oR IV. (a) __ Define Moore and Mealy Machine. Construct a Moore and a Mealy Machine that accepts the language (0+1)' (00+11) (a2) (b) ‘State and prove Myhill Neorode theorem. (8) v. (a) Define context free grammar. Give the context free grammar generating the set of patindromes over the alphabet {a5} © (6) Reduce the given grammar into CNF G=({S,4,B}.{a,b}, P,S) S bAlaB 7 A bAAlaS|a B->aBB|bs|b. @) (©) _ Explain the term useless symbol with an example. © OR Vi Define push down Automata, Find a PDA that accepts {w/w in(o+1)'} by empty stack 00) (b) Prove that a language L is accepted by a PDA by empty stack if and only if L is accepted by a PDA by final state. (10) Vl. (@)_—_ Explain the basic model of Turing machine. 6 (b) Design Turing Machine that can compute proper subtraction, That is : {" -n ifm2n m-n= | (as) 0 otherwise OR Vill (a) Design a Turing Machine to test whether the given input is prime or not. 6 (b) Design a Turing Machine *M’ to perform multiplication (ay IX. @_Define regular grammar. Show that if L is a regular set, then L is generated by some lefi-linear grammar and by some right-linear grammar. (2) (&) Explain Universal Turing Machine. ®) OR X. (@)_Define tinear bounded automata. Prove the equivalence of LBA’s and CSG. (b) Explain the relation between different classes of languages.