1. Reg. No. Question Paper Code: 82108501 K.S.K COLLEGE OF ENGINEERING AND TECHNOLOGY B.E./B.TECH DEGREE MODEL EXAMINATION- II DECEMBER 2021 Seventh Semester COMPUTER SCIENCE AND ENGINEERING CS8501-THEORY OF COMPUTATION (Regulation 2017) Answer ALL Questions. PART A – (10 x 2 = 20 Marks) 1.What is the difference between DFA and NFA? 2.Define the term epsilon transition. 3.State the principle of induction. 4.Define concatenation of strings. 5.Design a DFA that ended with three consecutive 0’s. 6.What is a regular expression? 7.What are the operations of regular expression? 8.What are the applications of pumping Lemma? 9.Define String homomorphism. 10.Define Arden’s Theorem. Year /Sem: III/V Maximum: 60 Marks Date: 22.12.2021(AN) Duration : 2 hrs PART B – (2 x 13 = 26 Marks) 11.(a) If L=L (A) for some DFA A, then there is a regular expression R such that L=L(R). OR (b) (i) Convert the regular expression (0+1)*(00+11) (0+1)* to an - NFA. (ii) Prove that L= {0n1n | n>1} is not regular. 12.(a) Detail about the various additional forms of proof. OR (b) Let L be a language accepted by an NFA, then there exists a DFA that accept language L. (13) PART C – (1 x 14 = 14 Marks) 13.(a) Minimize the DFA given below (13) (07) (06) (13) (14)

2. Reg. No. Question Paper Code: 82108501 K.S.K COLLEGE OF ENGINEERING AND TECHNOLOGY B.E./B.TECH DEGREE MODEL EXAMINATION- II DECEMBER 2021 Seventh Semester COMPUTER SCIENCE AND ENGINEERING CS8501-THEORY OF COMPUTATION (Regulation 2017) Answer ALL Questions. PART A – (10 x 2 = 20 Marks) 1.What is the difference between DFA and NFA? 2.Define the term epsilon transition. 3.State the principle of induction. 4.Define concatenation of strings. 5.Design a DFA that ended with three consecutive 0’s. 6.What is a regular expression? 7.What are the operations of regular expression? 8.What are the applications of pumping Lemma? 9.Define String homomorphism. 10.Define Arden’s Theorem. Year /Sem: III/V Maximum: 60 Marks Date: 22.12.2021(AN) Duration : 2 hrs PART B – (2 x 13 = 26 Marks) 11.(a) If L=L (A) for some DFA A, then there is a regular expression R such that L=L(R). OR (b) (i) Convert the regular expression (0+1)*(00+11) (0+1)* to an - NFA. (ii) Prove that L= {0n1n | n>1} is not regular. 12.(a) Detail about the various additional forms of proof. OR (b) Let L be a language accepted by an NFA, then there exists a DFA that accept language L. (13) PART C – (1 x 14 = 14 Marks) 13.(a) Minimize the DFA given below (13) (07) (06) (13) (14)

3. (b) Convert to a DFA the following NFA OR (14) 0 1 {p} {r} ф {s} p {p,q} q {r} r {s} *s {s} -------- All the best --------

4. (b) Convert to a DFA the following NFA OR (14) 0 1 {p} {r} ф {s} p {p,q} q {r} r {s} *s {s} -------- All the best --------