Total No. of Questions : 8] [Total No. of Printed Pages : 3 Roll No... CS-501 (CBGS) B.Tech. V Semester Examination, November 2019 Choice Based Grading System (CBGS) Theory of Computation Time : Three Hours Maximum Marks : 70 Note: i) Attemptany five questions. firrdl cia aeat at get He) ii) All questions carry equal marks. wot neal & WAR sin eI iii)In case of any doubt or dispute the English version question should be treated as final. fereft of repre & tee srerer flare Ht feerfer F sBtoft ara yer ot sifers AT AT 1. a) What do you mean by closure properties of regular languages? Define some important Closer properties. Regular languages (19T) & Closure properties (quit) & aa afinra &? He Aeayel Closer properties (quit) Fr furs <1 b) Obtain the regular expression for the following set : i) Set of all strings over 2=(a,b) with exactly two a. ii) L={a*|xis divisible by 3 or 5} Prafetac set & fer afer regular expression et Rea Rl i) wl strings 1 WIE L=(a,b) Hel saat two (I) a. ii) L=(a*| Set xan oy 3 sera 5a free a a} CS-501 (CBGS) . “4 PTOT (2] 2. Prove the following two properties : Prtifesa @) strana at eet wR: a) Regular set are closed over the intersection operation. Regular Set Intersection SERIA GK closed ave b) Let A and B are context free language over the same alphabet > then, prove that AUB (A union B) is also context free. art ft A ail Bet AIST, E alphabet & GA context free arent 2, at aearfta a Ht AUB (A union B) fH context free @FT1 3. a) Find the CNF (Chomsky Normal Form) for the following CFG: S-->ABA A-->aAle B--> bBle freafeiftaat CFG & fery CNF (Chomsky Normal Form) Sire BR: S-->ABA A->aAle B--> bBle b) Convert the following grammar to GNF : A,-->A,A, A,->A;A,|b A,->A, Ala Preaferftac grammar (ITA) to GNF 4 afafetct ae: A,-->A, A; Ay->AsA,[D A,->A, Ala CS-501 (CBGS) Contd...[3] Explain the Mealy and Moore Machines in brief. Also describe what are the differences between them. Mealy 84 Moore Heft 1 aida F care wt rer gee eT sary ot oft wrETEA . Designa PDA that accepts the language L={a" b™ a": m,n >0} Wh PDA (921 SISA tect) ar Prafor ay, sit Preafertaa aT (Language) al Wasa L={a" b™ a": m,n >0} What do you understand by recursive enumerable languages? Explain the Turing machine with its properties. Recursive enumerable languages (4191) 8 S19 Fat Gasic e? Turing machine (eft) ot Seep WTA a STEN OR ARENT BR . Describe the NFA and DFA in brief. Also, explain the construction of DFA for the following regular expression : r= (O+1)*(O0+11) (0+1)* NFA Wd DFA & daa F ofeas S cen Freafed regular expression & fey DFA Corl cht EAT TH wa afta we r = (0+1)*(00+11) (0+1)* . Write short notes on any three : Prafetadt 4 & ford cla & Gur dae F faaeor 1 i) Reducibility ii) Epsilon transition iii) Halting problem of Turing machine iv) NP complete problems skies