You are on page 1of 3
Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com CRES Scheme & ww TT] isc Fifth Semester B.E. Degree Examination, Dec.2017/Jan.2018 Automata Theory & Gompatibility Time: 3 hes. Max. Manta 0 Note: Answer FIVE full questions, choosing one full question fr ly Module-1 #1 & Define the folowing terms with oxamples! (Alphabet focSp an alphabet £ Gii) Concatenation (iv) Languages (04 Marks) 1b. Drawe DPA to accep tings ofes and b's ending with (eoarnrs) Fe Convent the following NDFSM Fig. Ql (tots equivalent (ona) i Rie ie #3 id Fig. Q1(@) [52 «prov aprsat wo scepttelngutes i Le foe fb)" :vanye fb) (o=x angfeay)v Ws x baday)} (3 Marks) : 1b. Define distinguishable and indistinguisH@be states)Minimize the following DFSM, : re ALC DLs DIA & [DIF F [G[e SIF IG HG) @ f distinguishable and indistinguishable state forthe automata. Gi State equivalent of automata. (69 Marks) o DFA, NFA and ¢-NFA. (ot Marks) ‘Oba cular expressions Ry Ri" and simplify the regular expressions as much as possible. (oP Marky ive tua expressions fr the following languages on 5) [beh «ll strings containing exactly one a 2L Any reveling ef spe a eva an equines wien e, 4248 )) all strings containing no moore than 3 a's. Gi) all strings that contain at least one occurance ofeach symbol in (@3Marksy Important Note: 1. On completing your enor, comps de dag es 10f3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com 15¢: 3c. Let be the language accepted by the following finite state machine, “ atest srt VO Indicate for each ofthe following regular expressions, whether it corrssty descries Lz @ — @ubajobta “se i) (eubpibb*a)* Gi) bavabta Gy) @ubaob*a)* OR 4 & Prove that the following language in not regular :L = ga" | a (8 marks) b. If Ly and Lz ate regular languages then prove hat MAL, Lila and Ly are vegular languages. (0s Marks) ©. Is the following grammar is ambiguows? (6 Marks) SiC+S|IC+SeS]a cob vias ees aa ccacamaatih. asinin en earmoee M a B—SbS|A|bb- © Let G be the grammar, S->aB/ba Apalas|bAd Bo b|bs|aBB For the string ind a (Left figs derMagjon. Right ation. ‘wee. (04 otarks) OR ve (09 marks) 6 a. Explai\the Wilowjng terms: A PushiigWs automaa PDA). i) \Languages of a PDA. stantaneous description of a PDA. @3 Marks) b PDA to accept the language L= foo" |e {a,bf'}. Draw the graphical representation of this PDA. Show the moves made by this PDA for the string aabbaa ‘10 Marks) the following CFG to PDA -2ABB|aAA Av>aBB|a B > bBB| A Coa (03 Mats) 20f3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com 15cS, Modute-4 7% IL) and Le are context free languages then prove that LyULy, Ly Ly and Ly are free languages. Give a decision procedure to answer each of the following questions: (Given a regular expression o. and a PDA M, the language accepted Ma siBbet cof the language generated by a? Gi) Given a context-free Grammar G and two strings S, and S, does G ge 2 {Giemsa coment fee Grummer does G mee ey evga sg, Gv) Given a Regular Gramma: G, is L(G) context-free? i2 Marks) oR 8 a. Explain with neat diagram, the working of Turing Machine gy. (0s Marks) b, Design a Turing machine to accept the language In >=). Draw the transition diagram. Show the moves made by this turing machine fgr tp tring (11 Marks) Module-5 ‘Non-deterministic turing machine. Linear Bounded automata. (16 Mares) 10 Write short notes on: Undecidable languages. 5. Halting problem of faring machi e “np asmtariy x & x - 3 0f3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative