Scribd
Upload
7 views2 pages

Theory of Computation - 2019

kl

Uploaded by

fthmsherinkp
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
7 views2 pages

Theory of Computation - 2019

kl

Uploaded by

fthmsherinkp
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
D 71666 (Pages : 2) ee THIRD SEMESTER B.A/B.Sc. DEGREE EXAMINATION, NOVEMBER -2019 (cUcBCSS—uG) BCA. BCA 8C 06—THEORY OF COMPUTATION (2017 Admissions) ‘Time : Three Hours Maximum : 80 Marks Section A Answer all the questions. Each question carries 1 mark. What is an automaton ? What is yield? Define subjective function with example. What are the components of a finite automaton ? Define PDA. What is regular grammar ? Define Function. Define relation with example. Find the regular expression for the set of all strings containing at most 2a's if alphabet set is {o.}. SP nee pe wp pw 10. What is a moore machine ? (20 x 1 = 10 marks) Section B Answer all the questions. Each question carries 2 marks. 11. Find R+if R={(a,), (b,¢), (c,a)} 12. What is a graph ? How a graph represented ? 13. Explain the closure properties of a regular set. 14. Find the sets represented by the regular expression a +b (a+b)*. ‘Turn over 2 15. Explain Type 1 grammar and Type 2 grammar with example. 16. Find the right most derivation for the string 00110101 if grammar GisS—+0B[LA, AO)0Sj1AA, A — 1[1S)0BB. 17. Explain the properties of a transition function. 18. ' Prove that the number of vertices in a binary tree is odd. D 71666 (8 x2 =16 marks) Section C Answer any six questions. Each question carries 4 marks. 19. FindL (G), if G =( {8}, {0,1}, {8 > 081,84} 20. Explain ambiguity in CFG with example. 21. Prove the Pigeonhole principle by induction. 22, Explain the steps for construction of minimum automaton. 28, Write different methods for representing Turing Machines. 24, Explain Strings and their properties. 25. How can we eliminate -moves from a transition system ? 26, Explain Arden's theorem . 27. Prove that, IfL is regular then L? also regular. (6x 4 = 24 marks) Section D Answer any three questions. Each question carries 10 marks. 28. Explain about Parsing and different types of Parsing. 29. Prove that, Fer every NDFA there exist a DFA which simulates the behaviour of NDFA. 30. Find a grammer in GNF equivalent to the grammer, E> E+T|T, T->T* F|F, F>(8)|a. 31. Explain simplification of Context Free Languages. 32. Explain Chomsky classification of languages. (8 x 10 = 30 marks)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy