gyi N, Reghunath Reo Meanay Library fot Sestiule of Foohnolegy Bengaluru - 960 070 SGH EVE = USN ] ap 170854 Fifth Semester B.E. Degree Exa: ‘ion, Jan./Feb. 2021 Automata Theory an N jomputabi Time: 3 hrs. S lax. Marks: 100 Note: Answer any FIVE full questions pepoosing ONE full question fot each module. Define Language, Grammer pfdiome with examples x (04 Marks) d Define DFSM. Draw a DESM thRccept the Language. i) L= {awa: we (aff. Verify for the string ag it) Set ofan stingy ea substring abb oR ‘a, b}. Verify for the string abba. (08 Marks) oP Conver the follovgjigXDFSM to its equivalent DFSM (Refer Fig Q1(c)) a OF er* ee © (08 Marks) or x 2 a. Constant an NDFSM for multiy le sywords L= {we (a, b)': 3x,y € fagBJe where eS) ( 0, m> 0} ii) L= igs 4,m<3} ig of O's and 1's Ree 10" symbol from the right end side is 1. Justify the Important Note: 1, On completing your answers, compulsor iii) Set answers. (08 Marks) >. State and prove pumpi june for regular languages. (08 Marks) c ce ae tain Regular grammer for the language = {we (a, byt; w ith the a a (04 Marks) 4a. Prove that forgqgy regular defined ee eau expression is also defined by Finite State Machine. (08 Marks) >. Prove that the“following Language is not regular L= {ww sve (0+1)’ is not regular} (08 Marks) c. Consiga NFSM which accepts the regular expression (atb)'abb. (04 Marks) 1of2 . as10 SS 170854 a. Define Context Free Grammer. Obtain the Context F1 ier for the following : ° i) L= {ww":we @b)} ii) Write a CFG to generate balanced rae Where Bal = {we { ), ( }; parenthesis are bal: Justify the answers. (08 Marks) b. Define Leftmost and rightmost son ag Bry Examples > otmarisy ©. What is ambiguous grammer? Show thafgfié following grammer is 1ous for the string id + id * id. POPSELECET ERY Elid . (08 Marks) cy, R a. Define PDA, and Instantaneous @@pMption of PDA. Obiail to accept the language. L = {wew® : we (a, b)'} ‘transition diagram of PDAY show the moves by this PDA. for the string abbcbba. ad (10 Marks) b. What is CNP and GNE2 €@pert the grammer in C S—> ABa gS A aab ’ B- Ac ©. Forthe following YFG © s> asbhigy » Obtain sponding PDA. cf le-4 a. State the prove Pumping Lemma agbrem for Context Eagan guages. (08 Marks) b. Show that L = {a"n’e"| n> 0} ignot context free. (08 Marks) c. Remove all unit productioigm the grammer © S> AB x 8 2 Asa . x Bate gy” NY & bite SPS E> djAb (04 Marks) O “yor a a. Expl neat dingam a Yorting ofa Turing fachine Model. (06 Marks) b. Design ¥ Turing Machi ept the lan, {0"1"2" | n> 1}. Draw the transition Show that mofedpade by this n for the string 001122. (10 Marks) 2g fly explain the yeehrfiques for Turing’ \ine construction, (04 Marks) 8 dute-s a. Design a TugagMachine to acgaphe language L = {0"l"| n > 1}. Draw the transition diagram s moves made UP¥Pis machine for the string 000111 (10 Marks) b. Explain the feflowing : ’ i) Multitape Turing Ye ii) Post corresponder sblem, (10 Marks) OR Write short notes Non Determinigty ring Machine Halting Problertipt Turing Machine Quantum Confputation with example Model offingar ‘bounded automation. (20Marks) 3 Monet e pe oe