Save trees use e-Question Paper DOWNLOAD THIS FREE AT Go green www.vturesource.com CBCS SCHEME uss ] 1s Fifth Semester B.E. Degree Examination, Feb-/Mar. 202 Automata Theory and Computability Time: 3 hrs Max. Mateo Note: Answer any FIVE full questions, choosing ONE full question freguaaal, moda. g Module £1 a. Define the following terms with examples : a 4) Alphabet ii) String iii) Language ingest ‘at Languages 3 ¥) Power of an Alphabet. Go Marks i b. Define DESM. Design DESM a 4) To aceept strings having Even number o nm fs B fi) To aceept binary numbers divisible by 5. oMarks as or ES 2 a. Convert the following NDESM of DFSM. [Ref be Qt a (os starts) a4 1b. Minimize the following DESM byéflnlengis MMOD istinguishable and. Non-distinguishable be states ae 1 fi FE zi Bate 33 clate 2 p[cle ay FORTE ee Fela ds Gate i u (Ge a 2 aks) 4 Modute-2 EZ 3 a Define! sion, Write RE forthe following Languages. ao Marks eE ‘of 0's and 1's nding with thece consecutive Zorbes 3 0's and b’s having substring aa . 8 1b. Write DSN accept intomestion of Languages I= (4 b)'a and La=(a+b)’b GoMarka 3 on § aay: Mears treorem, prove that for any Regular Expression R, their exits finite “which accepts L¢R). (Qo Marks ser ig Lemma for Regular Languages. Show that the Language ww sv €(0,1)) is not regular ao Marksy Lof2 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 18: 5 8, Define Context Free Grammar, Design CFG for the following Languages DL w s| Mod 0} over i La= (hE em = n+ k overs > b. Define Ambiguity. Consider the grammar E—E+E|E*E|@) id TFnd Leftmost and Rightmott derivations and parse tree forthe string id-+ id * glo ihe gemma a smiguone, cattter or ° 6 4, Whatis Chomsky Normal Form of CEG? Conver the following eran gag S—> ARC [BaB AwpaA| BoC jaan B bpp aD CocAy AC Dou Eliminate &~ productions, Unit productions and useless Sijypl if amy before conversion, ‘Go Marks) 1. What 8 NPDA? Desisn NPDA foe Language L~ tayg “WW Draw transition diagram Write sequence of moves made by NPDA to acy the stgaabb. ‘a0 Stars) Modu! 7 a, Design TM for WOW" over E = {0,1}. jon diagram, and ID for w = 101101 (14 Marks) 1b. Explain +i) Multitape i) Non-determinis (06 Marks) 8 4, Define Tuming Machine. Explain KinB) of Tuming Machine, (06 Marks) b. Design Tuming machine to the daggtage = [02m >= 0}. Draw the transition diagram, Write sequence off by TM for string 001122. 14 Marky 9a, Explain Halting probl 7 Marks) b. Write applications 9f TuRiyg Machine. (6 Marks) ¢. Explain Recursivel Languages. (07 Marks) oR 10 Explain (07 Marks) b. Explain on (o7 Marks) ©. Explain CRggch Timing Thesis, (06 Marks) 20f2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative