2 Any ving ois pea valent an reo ween ce. 12*8e wl weed a mabe. ptt Nee: 1. On completing your snore, compu rm digress on he remaining Mek age CBCSISCHENE I é sacss4 |Fifth Semester BLE. Degree Examination, Jan/Feb, 2021 Automata Theory and Computability § Max. Maths: 100 ‘Note: Answer any FIVE full questions, clidostig ONE full question from each module, let Define the following with ')String i) Language i} Alphabet iv) Symbol (4 aria) b.__Designa DFSM to accept each ofthe following language; ) {we fa, b)° has al strings that ends with sub string abb ) iL whee fs6d3 = Owhee = af} il) _L= (we (:6)" evry region inw iso ven length) ovat) onal Side DEA fom he flowing gen NFA wing set comtacton method. (Refer Fig.Q.1(€)) (7a) Fig Qe) 7 ors. ’ Construct a minimum state automation cquiysient tothe FA ives table States | 0 7 . ao Marks) (oMarks Fig Q2(0) of?1scss4 Modute-2, Define Regular expression. Write RE forthe following languages: | aa i 9) L=(atb"|m-n iseven} i) L=fe'b"|m2t azt am23} : A ii) L=(a™b™|n20,m20} omar ; . Construct an ¢ - NPA forthe regular expression' 01° (0s mart) i Construct on FA forthe regular expression 10°+(0% 11)0"L (os Mark) q -~ i 4 a. State and prove punping lemma theorem gular lang (oa martsy uy 1. Prove that L= (apis prime} i not «vogue. AES) TESS (os maris) hy Listou closure properties of euler Sts f Ca 2S Qy (o4Marts) i Hteauies (f(s. 5 a. Define CFG, Write a CFG testy ert ') all string over {a,b} that are even and odd palindromes. CW od i ii) L=(a"b" over £=fo,b)n21} : Sez ee) i +. Write the procedure for moval of e-productin’: Simplify the Tllowing gram. rf SraklaBB AdaAdle . ‘ Bb bbc i CoB cao arts) i 7 iq, OR j 6 a Define PDA. Design a PDA for the language that apts the string with ny(w) < mw) wh a+) ad show einen deen ofthePDAon np anh ! Whats CNF and GNF? Convert the flowing mina into GNF i Saale : ; Asso . ’ coat ; Modtule-4 } 7 a. With neat dagran explain variant of uring machine ‘costar 3 Cons Tig shine tnt re gage 1" when Land nin } fyaph br Tuning Machine "o toxins 4 4 “oR } 8 2 DefideThiming Machine wih apes 7 extant t ‘Explain the working principe of Turning Machine with diagram, Design a Turing Machine } tect tgs fro (0,1 nd eding ih 0D We rmstin diagram ad TD or i 01000 i 7 . ema (Modules 9 a mitigate macng (oomart Explain the fllowing wih example 3 4)" Decidabity i) Deidable languages ii) Undecidable languages. (2 Mara) ; ¢ OR } 10 Writeashort ote on : 2. Poo correspondence problem j i Hating problems fa Turing Machine 4 Linear Bound Aujmation (LBA) i Chases of and NP en arey 4 é 2of?