Last year question bank of fafl, Exercises of Compilers

Download Last year question bank of fafl and more Exercises Compilers in PDF only on Docsity!

Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com — 100856 Fifth Semester B.E. Degree Examination, Dec.2013/Jan.2014 Formal Languages and Automata Theory Time: 3 hrs. Ma arks: '> Note: Answer FIVE full questions, selecting at least TWO questions from each part. PART-—A 1. a. Mention the differences between DFA, NFA and €-NFA. (06 Marks) b. Design a DFA which accepts set of all strings of 0’s and I's. be 1 that, when interpreted as a binary integer, is a multiple of 5. For examplg s' O10 and 1111 are in the language; 0, 100, 0101 and 111 are not. (06 Marks) ¢. Convert the following NFA to DFA using subset construction od: (08 Marks) é 0 1 >p| ip.) Lip} *r | tp, iq 2 a. Consider the following €-NFA. i) Compute the €-closure ii) Give the set of all stri less accepted by the automation. iii) Convert the automatii (08 Marks) b. Give the regular expresgign: ing languages: i) L={a"b™: ns = {wwe (0.1) and |w| mod 3=0}. (04 Marks) c. Mention the applicatio egular expressions. (02 Marks) d. Prove that every’ ined by a regular expression is also defined by a finite automation. (06 Marks) 3 a mma for regular languages. (06 Marks) b. sion from the following finite automation using state elimination ‘4 Marks) When two states are equivalent or distinguishable? Minimize the following DFA using table ‘a iii (10 Marks) BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative