» VIT-AP UNIVERSITY Apply Knowledge. Improve Life!” QUESTION PAPER Name of the Examination: Fast Track Fall 2023-24 - FAT Course Code: CSE1008 Course Title: THEORY OF COMPUTATION: set number: 04 vateoftxam: | 8/e/a3 (81) CFR) Duration: 120 minutes Total Marks: 60 Instructions: 1, Assume data wherever necessary. 2. Any assumptions made should be clearly stated. Ql. a. Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) (7M) 6 0,1 b. Design an NFA from the given RE [ ab + (b + aa)b* a]. (8M) Q2. a. LetL={a'bic*li,j,k> 1 andit+j=k} Find a PDA (which accepts via final state) that recognizes L. (8M) b, Construct a CFG to generate N(M) where M=({p, g}, {0, 1}, {X, Z0} 8, q, Z0, ®) (7™) where 6 is defined as follows: 1. 8(q, 1, Z0) = {(q, X Z0)} 2, 84, 1, X) = {(q, X X)} 3. 0, X)= 4. 8(q, £, Z0) = {(q, £)} 5. 8(q,1, X) = {@, &)} 6. 8(q, 0, Z0) = {(q, Z0)} Page 1of2Q4. a. Convert the following CFG to CNF (Chomsky Normal Form), (10M) S— ABA A-aAle Bo bBle b. Use the pumping lemma to prove that the language A= { "15" 0"| n> 0} is not context free. (5M) Q5. Design the Turing machine M that recognizes the language L = { 0" | n> 0 }. Show the steps, operations in the tape. Draw a transition diagram for the Turing machine constructed above. Give ID for the strings ‘0000’ and ‘000’. (15M) P_ MAPPING Module co PO PEO No. | number | Mapped | Mapped | Mapped | PSOMapped ) Marks a 42 123 12.3 14 123 i L (748) 2 a 3 345 1234 123 15 (347) = A 5 3,45 1234 223 15 a (1045) ce cS 4 345 1234 123 15 Page 2 of 2“eb Koel ies aye QUESTION PAPER Name of the Examination: First Track Fall 2023-2024 — FAT Course Code: CSE1008 Course Title: Theory of Computation Set number: 05 Date of Exam: nl#a3 (4) CFR) Duration: 120 mins Total Marks: 60 Instructions: 1. Assume data wherever necessary. 2. Any assumptions made should be clearly stated. Qi. Q2. Q3. fa) (b) fa) (b) Design a Deterministic Finite automata which accepts all strings over (7p) {0,1} with odd number of 1’s and even number of 0's. Consider the grammar G=(V, 5, R, S), where (em) SAA AD AAA Ava A>bA A> Ab Find the language accepted by the grammar and show that it is an ambiguous grammar. Design a PDA accepting by empty stack for the language (sm) L=(w ew | we (a, b)*} Design a PDA accepting by final state for the language 7m) L={a" b™ a" | m, n20} Convert the given CFG G to GNF(Greibach Normal Form) (15m) S-> ASA | BSB la AraAlacla C>aBA B>bBle Page 1of2aa. Construct a Turing Machine for the Language L= {0" 1" | n 2 1}. Show (10m) fa) the steps, operations in the tape. Draw a transition diagram for the Turing machine constructed above. Give ID for the strings ‘000111’ and ‘001’. {b) Illustrate the concept of PCP and verify whether the following lists have (sm) a PCP solution. abab ) acre) (2) ( ba ) (eat (“) .ababaaa, bb }’\baa/’\baa)'\ba/’\ a QP MAPPING Module PO PEO Number CO Mapped Mapped Mapped PSO Mapped Marks ai 1,3 1,2,3 1,2,3 12,34 12,3 15 (748) Q2 4 3 3,4,5 1,2,3,4 1,2,3 15 (8+#7) a3 5 4 3,4,5 1,2,3,4 1,2,3 as a4 6 4 3,4,5 1,2,3,4 1,2,3 15 z (20%s) Page 2 of 2