Save trees use e-Question Paper DOWNLOAD THIS FREE AT Go green www.vturesource.com CACS SCHEME usN Time: 3 hes. DL ce. Desig Lo" Note: Auswer any FIVE full questions, choosing ONE full question fro mode Modute-1 La. Define ing terms with an exam 3) Alphaby crf on alphabot ing concatenation v) lang! the hierarchy of language classes fc. Design DESM for each of the following language: fe €{0.1}" -@ docsnotendin 01} ii) L= (oe fa,by : every ain o is immediately expression. Write reg 1) m>1,n2 1,0 ii) L= toe fa. by sstring with tain NDESM forthe regular expression (a 9 Fifth Semester B.E. Degree Examination, July/August 20: Automata theory and Comput: y Maretoo. Max. us (OS Marks) ‘automata theory (05 Marks) and followed by b} (0 Marks) on Use MINDFSM algorithm to minimize M given in QO, Fig Q20@) (os Marts) Cb) to its equivalent DPSM. Fig Q20) (08 Marks) that takes binary number as input and produces 2°s complement of (04 Marks Module-2 ~xpression for the following language. nost one pair of consecutive a's} (08 Marks) Usb) by’ (05 Marks) 10f3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com 18CS54) Build a regular expression for the given FSM in Fig Q3(). @ mans) mi @ 4 State and prove pumping Lemma theorem for rule langue (os stark Prove that regular languages are closed under complement. (OS Marks) © Write regular expression, regular gramn ‘rand VSM for thgliguages L= foe {a,b}: wends with pattem ana} (07 Marts) Modute-3, $a. Deine Context Free Grammer (CFG). Write CFG for HhMgUowtng languages 2 Macbeth Pet penta et saat aH oath LM) Co*\oeg Is reverse of «} srk rene aon amy ae 1 Degg et _ 2ofs BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com oR 8 a, Design a TM forthe language L = {1"2"3"| n> 1) show that the string 11 by ID. b. Demonstrate the model of Linear Bounded Automata (LBA) with a neat disgrankg\os MarR) Module-5 9 4, Show that Aora it decidable Brians, b. Define Post Correspondence Problem (PCP). Does the PCP with t Jb, bab", ba) y= (b', ba, b) have a solution, (8 Marks) ce. Esplin quantum computation (07 Marks) oR 10 a. Prove the Anis undecidable (05 Marks) 1b. Does the PCP with two list x = (0, 01000, 01) y = (0 ave a solution. (OS Marks) fe. State and explain Church Turning Thesis in detail (10 Marks) 30f3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative