Scribd
Upload
6 views2 pages

Sample Paper 4

This document is an examination paper for a B.Tech course on Formal Language and Automata Theory, consisting of two parts: Part A is compulsory with 25 marks, and Part B contains five sections where students must answer one question from each section for a total of 50 marks. The questions cover topics such as finite state machines, regular expressions, grammars, pushdown automata, context-free grammars, and Turing machines. The exam was conducted by Malla Reddy College of Engineering & Technology in April/May 2017.

Uploaded by

Shubham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
6 views2 pages

Sample Paper 4

This document is an examination paper for a B.Tech course on Formal Language and Automata Theory, consisting of two parts: Part A is compulsory with 25 marks, and Part B contains five sections where students must answer one question from each section for a total of 50 marks. The questions cover topics such as finite state machines, regular expressions, grammars, pushdown automata, context-free grammars, and Turing machines. The exam was conducted by Malla Reddy College of Engineering & Technology in April/May 2017.

Uploaded by

Shubham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
R15 Code No: R1SAQS06 MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY (Autonomous Institution — UGC, Govt. of India) 11 B.Tech Il Semester Regular Examinations, April/May 2017 Formal Language and Automata Theory (CSE) Roll No N] 3 Time: 3 hours Max. Marks: 75 Note: This question paper contains two parts A and B Part A is compulsory which carriers 25 marks and Answer all questions. Part B Consists of 5 SECTIONS (One SECTION for each UNIT). Answer FIVE Questions, Choosing ONE Question from each SECTION and each Question carries 10 marks. PART-A (25 Marks) 1. (a) Define Finite State Machine. (2M). (b) List out the applications ofa Finite Automata (GM) (c) Show whether (0+1)* 100 is regular or not (2M) (d) State Pumping lemma for Regular Sets. (GM) (e) Define a right linear grammar with an example. (2M) (f) How do we say that the given grammar is ambiguous? @M) (g) Define PDA. QM) (h) How do we show the acceptance of CFL? (GM) (i) Define turning machine, How a TM accepts a language? M) @ Explain the classes P and NP. (GM) (50 Marks) 2, Design a DFA for the following language L={0™1"|m>0andn>1} (OR) 3. Find DFA equivalent to NFA, described by the following state transition table. IS=p, F.S={q, s} oq — 0 1 =P {gs} Q G) ‘ a SECTION — II 4, Consider the following regular expression and construct the finite automaton a) atb b) (a+b) ©) aa +b)” d) afa+b)*b (OR) 5. Convert the R.E. = (alb)" into DFA SECTION - II 6. Construct right-linear and left-linear grammars for the following regular expression, 0" a@H)y)" (OR) 7. Construct the left-most and right-most derivations and parse trees for the following grammar > Ss” aB|bA AP aS DAA La > B ~ bS|aBB |b which accepts the string “aaabbabbba”. SECTION ~IV 8. construct PDA accept the language L={a"b” n>0} (OR) 9 Construct CFG, G=({S,A,B}, {a,b},P,S) with production set P as S—> aAbB;A > Ab/b ; B—> Ba/ato CNF SECTION-V_ 10. Design a Turing Machine that recognizes any palindrome of digits {0, 1}. Give its state transition diagram and table. (OR) 11, Find whether the post correspondence problem P = {(10, 101), (O11, 11), (101, O11)} has a match. Give the solution.

You might also like