×
Failure will never overtake me if my determination to succeed is strong enough.
--Your friends at LectureNotes
Close

Previous Year Exam Questions for Automata Theory And Computability - ATC of 2017 - AKTU by Ravichandran Rao

  • Automata Theory And Computability - ATC
  • 2017
  • PYQ
  • AKTU - AKTU
  • Computer Science Engineering
  • B.Tech
  • 8 Views
  • Uploaded 2 months ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

Sub Code: NCS402/CS404/ECS403 Printed Pages:02 Paper Id: 110403 Roll No. B. Tech. (SEM IV) THEORY EXAMINATION 2017-18 THEORY OF AUTOMATA & FORMAL LANGUAGES Time: 3 Hours Total Marks: 100 Note: 1. Attempt all Sections. If require any missing data; then choose suitably. SECTION A 1. Attempt all questions in brief. a. b. c. d. e. f. g. h. i. j. 2 x 10 = 20 Explain the applications and limitations of finite automata. Explain what modifications will be required to transform a Finite Automata model into Turing machine. What is MyHillNerode theorem? Explain. What is extended transition function*? Explain with example. Give the difference between Mealy and Moore machine. Define and give the difference between positive closure and Kleene closure. What in nondeterministic PDA? Explain with the help of transition function. Give the regular expression for set of all strings over {0,1} containing exactly three 0’s. Prove or disprove that union and concatenation of two context free languages is also context free. Explain recursively enumerable languages with example. SECTION B 2. Attempt any three of the following: a. b. 10 x 3 = 30 Explain the purpose of following FA: (q1, a) = q1, q2, (q1, b) = q3, ( q2, a) = q3, q2 q1is initial state and F = {q2, q3} Let the languageof FA given below be L. Determine the FA accepting L(i.e. Complemented language). b a, b a b A B C D a c. d. e. Prove that for all sets (i) ( S  )   S  , (ii) (S+)* =S* Prove that the language L = {anbncn|n≥0} is neither regular nor context free. Explain Church’s Thesis and prove that Halting problem of Turing machine is undecidable.

Text from page-2

SECTION C 3. Attempt any one part of the following: (a) (b) 4. (b) 5. (b) (b) 7. (b) 10 x 1 = 10 Design PDA for language: L = {s (0, 1)* |number of 0’s and 1’s are not equal in every string of s}. Construct a Turing machine to accept the language L = {anbncm| m, n 0}. Attempt any one part of the following: (a) 10 x 1 = 10 Determine the grammar for language L = {anbm| n m}. Also explain the type of this language. Construct context free grammar G corresponding to following context free language, then construct PDA corresponding to G L = { 0 n 12 n | n 1} Attempt any one part of the following: (a) 10 x 1 = 10 Determine the language generated by grammar S Sab | aSb | abS| baS| bSa| Sba| aS| a What is inherent ambiguity? Explain with the help of suitable example. Attempt any one part of the following: (a) 6. Give finite automata for: i) L = {anb2mc3l | n, m, l  0}. ii) L = {anb2m | 0 <n <3, m  0}. Design DFA to accept all string over {0, 1} not ending with 10. Attempt any one part of the following: (a) 10 x 1 = 10 10 x 1 = 10 Explain variations in Turing machine to make it more capable. How Universal Turing machine can be considered as model of digital computer? Explain Modified Post Corresponding Problem. Does the following Post Corresponding Problem have a solution? A= (101, 100, 10, 0, 010), B = (10, 01, 0, 100, 1)

Lecture Notes