5675154 EXAMINATION, B.Tech. DEGREE OV CEMBER 2016. NOVEMBER/DE Fifth Semester n Technology MPUTATION Time : Three hours Maximum : 75 marks PART A— (10x 2= 20 marks) 7 Answer ALL questions. Informatio THEORY OF CO All questions carry equal marks. Describe Mealy and Moore machines. 1. 2. State the characteristics of automaton. 3, Describe the applications of regular expressions. 4, What is meant by ambiguous grammar? 5. | Whoinvented Turing machines? S:. What is meant : language? it by recursively enumerate ©ll. 12. 13. 14. What is the relationship between finite automaton and push down automaton? State closure Properties of context-free languages. Distinguish between top-down and bottom-up Parsing. What is meant by LR(K) grammars? PART B — (6 x 11 = 55 marks) Answer ALL questions, ONE from each Unit. All questions carry equal marks. UNITI Explain the equivalence of NFA and DFA. with examples. Or Discuss the importance of Epsilon — transitions with examples. UNIT II Discuss the normal forms for context-free grammars. Or State and prove pumping lenima for CFL. 2 5675154 15. 16. in 18. 19. 20. UNIT IIL Explain the method of constructing Taig machine. Or Construct a Turing Machine to accept the set Ly all strings over {0, 1} ending with 010. UNIT IV Explain the equivalence of PDA’s and CFG's wig examples. Or + Describe the importance of deterministic push down automata. UNIT V Explain the construction of top-down parser Wi an example. : Or Elaborate on the properties of LR(K) grammars.5675154 B.Tech. DEGREE EXAMINATION, APRIL/MAY 2017. Fifth Semester Information Technology THEORY OF COMPUTATION (2013 — 14 Onwards) Time : Three hours Maximum : 75 marks PART A—(10x2= 20 marks) Answer ALL questions. All questions carry equal marks. 1. Differentiate deterministic and non-deterministic finite automata. Is the string ‘01100 a member of the set represented by the regular expression 00(0+1)*0? Justify your answer. Construct fini ‘ite automation equivalent to the regular expression (q+ b)* abb.eo ere 12. 13. 14. State Church's turing hypothesis. What is parsing? Give an example. Define the language accepted by a PDA. Tn what way an LALR parser is different from an LR() parser? What is meant by ‘handle pruning’? PART B— (6 x 11 =55 marks) Answer ALL questions, ONE from each Unit. All questions carry equal marks. UNITI Explain the method of. constructing a DFA equivalent to a given NFA. Or What is minimization of finite automata? How it is done? Explain. UNIT II State and prove pumping lemma for CFLs. Or Explain the method of converting a CNF grammar into greibach normal form, with an examiple. 2 ra 5675154 17. 18. 20. UNIT IIL Discuss Turing machine construction. Give an example. OF ‘i shine can simulate a RAM, Prove that a Turing macl provided that the elementary RAM can themselves be simulated by a TM. UNITIV Prove that if 'L' is L(Mz) for some PDA Mz, them 'L! is N(M)) for some PDA Mi. Or Prove that if 'L' is a CFL, then the exists a PDA 'M' such that L = N(M). UNIT V With an example, explain how SLR parser is constructed. Or Construct the non-empty sets of LR(1) items for the following grammar S+A,A-ABIE BaBlb.UNITIV If L = N(Px) for some PDA Pw = (Q, 5, Tr, 6, 0, ZO) then prove that there is a PDA Pr such that L = L(Pr). qa) Or Let p=(Q, £, I, 5, 0, Z0)be a PDA, then prove that there is'a context-free grammar G such that L(G) = N@). aly UNITV Construct recursive-descent parser, starting with the following grammars: ay (@) S>48S-SSia @) $>0S101 © S+SOSle Or Construct of canonical-LR parsing tables. Input: An augmented grammar G’. Output: The canonical-LR parsing table functions ACTION and GOTO for G’. + sy) 5675154 56 75154 B.Tech. DEGREE EXAMINATION, NOVEMBER 2017. Fifth Semester Information Technology ‘THEORY OF COMPUTATION (2013 — 14 onwards batches) ‘Time : Three hours Maximum : 75 marks PART A — (10 x 2 = 20 marks) Answer ALL questions. All questions carry equal marks. 1. Differentiate NFA and DFA. 2. List the ways of theorem proving. 3.. Discriminate IFF and IF statement. 4: List the different closure properties of Regular Languages.Find the Regular Expression for the: given automata. uw 12. Annotate multiple tracks in TM. State counter machines. Define formal definition of Pushdown Automata DA). List out the various ways of defining “IF-THEN’. State parsers. PART B— (6x 11=55 marks) Answer ALL questions, ONE from each Unit. All questions carry equal marks. UNITI Let L be the Language accepted by NFA (Mn), then prove that there exists DFA (Mp) such that L=L(Mp). Convert the following NFA to DFA. STATES I/P SYMBOLS >P q r ts *t Or ab a fp, 8} {rs} rth on o © o © 2 ab ay 5675154 13. 14. 16. 16.” UNIT II Construct the finite automata for the giney . Regular Expression. 01*((00)"+111)*+0)*1. (y Or Construct the Minimum State automa ivalent for DFA. ics cquivalent STATES 1/P SYMBOL 3 qo c1 >qo al 490 ql gk a2 2 al *q3 30. a4 a a6 a4 a6 a5 a6 q7 G8 Z UNIT IH Design Turing Machine for the followi languages. a (a) The set of ‘all strings of bala parenthesis. (pb) {0"1"0"1™/m,n >= 1} © wwihwe 0, }*} Or Prove that if Mp is a nondeterministic Turing Machine, then there is a deterministic ‘Turing Machine Mp such that L(Mx)=L(Mp). ay 3 56751545675154 B.Tech. DEGREE EXAMINATION, NOVEMBER 2018. — Fifth Semester Information Technology ‘THEORY OF COMPUTATION (2013 - 2014 onwards batches) Time : Three hours Maximum : 75 marks PART A— (10x 2= 20 marks) Answer ALL questions. ‘All questions carry equal marks. 1. Give the importance of Finite Automata. 2. How is an expression be categorized as a Regular expression? 3. What is a Context Free Grammar? 4, Give a sample derivation tree. 5. Expand and Define TM. 6. How the complexity of TM is computed?i. 12. 13. What is PDA, in terms of computation theory? What are Context Free Languages? HOW to identify LR(0) grammar? Give out the significance of LALR parser. PART B— (6 x 11 = 55 marks) Answer ALL questions, ONE from each Unit. All questions carry equal marks each. UNITI Contrast and Analyze Deterministic Finite Automata “and Non—Deterministic Finite Automata. Or Make a detailed overview on the applications of Finite Automata with its impact. UNIT II Give a detailed account on Regular sets and Closure properties. Or 2 5675154 14. 18. 19. 20. i mparative analysis of Chomsky N fava lind Greibach Normal Forms. ory UNIT II Enlist the process of constructing ™ 4 elaborative steps Or Comment on “Church's Turing Hypothesis", UNITIV Write in detail about Deterministic PDA. Or Summarize on the equivalence of PDA and CF, UNITV In what are all the ways Top down parsing gets; difference from Bottom up parsing? Elucidate. Or When does the LR(1) grammar is followed? Just the choice of it.UNIT IV Construct a PDA to accept the language =o" b"c"d" = n,m 21}. ay Or Let L be a context free language. (a) Prove that there exists a PDA that accepts L. 6 (») Prove that context. Free language are closed under union and concatenation. @) UNIT V Explain Automatic construction of bottom -up parsers. any Or xplain top — down parsing with examples. (11) 4 5154 ‘Time : Three hours 5675154 B.Tech. DEGREE EXAMINATION, MAY 2018. Fifth Semester Computer Science and Engineering THEORY OF COMPUTATION (2013 — 14 batches) Maximum : 75 marks PART A — (10x 2 = 20 marks) Answer ALL questions. Write the difference between DFA and NFA. Define context-free grammar. Give any two applications of finite automata. State pumping lemma for context-free language. What do you mean by universal Turing machine? What is the difference between recursive and recursive enumerable languages? Illustrate the rule for construction of CFG from + given PDA,; ” 8. What is instantoneous description (ID) of a PDA? 2? 9. What do you mean by bottom up pai 10. Write the purpose of canonical ~ LR parser. PART B — (5 x 11 = 55 marks) Answer ALL questions. Answer FIVE questions by choosing ONE full question from each Unit. UNITI ve 11. Minimize the number of states for the following DFA explain stepwise. QD 4 oh => a : @ 1b. . Vv v4 Or 12. - Construct of NFA for the given regular expression 16. (10+1) (0+1)" 2 5675154 UNIT IL (a) Show that L =[0" Y=" 21} isnot Bulg (b) Find a grammar in CNF eauiralen grammar G with set of produ given P={S + aAbB, A> aA/a, B+ 6B /)) Or (a) Show that the language L = {a*¢" Yan ip not context-free using pumping lemma ¢ (&) Construct grammar in Greibach nop, form (GNF) equivalent the grammar wit production rules as: S—>AAla, A>SS/b. UNIT IIE Design a Turing machine M to accept i lanugage 1 = "1" =n21}. Compute the a 0011. Or Prove that if a language L is accepted by multitape Turing machine, then it is accepted by single-tape Turing machine. 35675154 B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2019. Fifth Semester Information Technology THEORY OF COMPUTATION (2013-14 onwards regulation) Time : Three hours Maximum : 75 marks PART A — (10 x 2= 20 marks) Answer ALL questions. 1. Specify the differences between NFA and DFA. 2. Write the applications of automata theory. 3. Define ambiguous grammar. 4. Write the principal closure properties for regular language. 5. . What do you mean by a Turing Machine with two way infinite tape. 6. Write the elements of a Turing Machine?x \ 10. 1. Define Push down automata. 12. Design a push down automata for the CFG G with productions: S+XSle,A—aXb|Ad| ab, Distinguish between top-down and bottom-up parsing Mention the types of LR parser. 13. PART B — (6 x 11 = 55 marks) Answer ALL questions. (a) Construct the equivalent DFA of the NFA given in Figure (1) 14, Figure (1): NFA 15. Or (®) Differentiate Mealy Machine from Moore Machine. Explain the algorithm to convert the Moore Machine to Mealy Machine with an example. 2 5675154 (a) (b) (a) (b) (a) (b) (a) (b) uss the properties (union, inte, of regular languages and explain a example. | Or State the Chomsky Normal Form, 3, the algorithm to convert into. CNF example. Design a Turing machine to accept hap 40"1"2" |n >=}. “a Or 1g Describe the programming techniqus ‘Turing Machines. Explain the us of ag tape Turing Machine with its configuatag Construct Push Down Automata fe § language L={ww" wis in (a+b)’}, Or Compare DPDA with NPDA 12° Determine PDA have an equivalent i deterministic PDA? Justify with an exangi Explain the construction of top-down pas with an example. Or Explain the working of the LALR pat with suitable examples. 3 56755 PO A See5675154 B.Tech, DEGREE EXAMINATION, SEPTEMBER 2020. Fifth Semester Information Technology ‘THOERY OF COMPUTATION (2013-14 Regulation) ‘Time : Three hours Maximum : 75 marks PART A— (10 x 2= 20 marks) Answer ALL the questions. All questions carry equal marks. 1. Define DFA. Draw the Transition Diagram (automata) for an Identifier. 3. What is a Regular Expression? 4, State Chomsky Normal form theorem. 5. Define Halting Problem. List the primary objectives of turing machine.When is push down automata said to be deterministic? What are the closure properties of CFL? 9. Define a Parser, State the difference between top down and bottom up parsing. PART B— (5 x 11=55 marks) Answer FIVE questions by choosing ONE full question from each Unit. All questions carry equal marks, UNITI 1. Construct DFA to accept the language L = {w|w is of even length and begins with 11}. Or Discuss the basic approach to convert NFA into regular expression. Illustrate with an example, UNIT Ir Using pumping lemma for the re that the language L = {a’ regular, 13. gular sets prove "b"|m>n} is not Or 14. With an example convert CF G to Greiback normal form. 2 5675154 ieee ssireess: eines 15. 16. 17. 18. 19, 20. UNIT II Discuss the various techniques of Turing ma construction. Or Write short notes on : (@) Two way infinite tape TM (b) . Multiple tracks TM. UNIT IV Prove the equivalence of PDA and CFL. Or Construct a transition table for PDA. which ac the language. L=(a*—b"|n21} Trace the PDA for n=3, UNIT V Construct a SLR parsing table for the Gramm: E>SE+TI|T ToT*FIF Fo @®)lid Or Construct the set of items (LR) for gram: S+cc C+cCla