Scribd
Upload
10 views4 pages

Toc ND2019 1

The document is an examination paper for the B.E/B.Tech. degree in Computer Science and Engineering, specifically for the Theory of Computation course. It includes various questions on topics such as deterministic finite automata, regular expressions, context-free grammars, Turing machines, and the pumping lemma. The exam is divided into three parts, with a total of 100 marks allocated for different types of questions.

Uploaded by

monkeydluffy9042
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
10 views4 pages

Toc ND2019 1

The document is an examination paper for the B.E/B.Tech. degree in Computer Science and Engineering, specifically for the Theory of Computation course. It includes various questions on topics such as deterministic finite automata, regular expressions, context-free grammars, Turing machines, and the pumping lemma. The exam is divided into three parts, with a total of 100 marks allocated for different types of questions.

Uploaded by

monkeydluffy9042
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/ 4
Reg. No. : B.E/B.Tech. DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2019 Fifth Semester Computer Science and Engineering CS 8501 - THEORY OF COMPUTATION (Regulations 2017) Time : Three Hours Maximum : 100 Marks Answer ALL questions PART-A (10x2=20 Marks) orl Le eel n . Prove by induction on n 21 that 2 Gap net . Formally define deterministic finite automata. ~ 8. Construct regular expression corresponding to the state diagram. s State pumping lemma for regular languages. 5. When do you say a CFG is ambiguous ? = Give a formal definition of PDA. x What are the advantages of having a normal form for a grammar ? 2 Define the language recognized by the Turing machine. 9. When do you say a Turing machine is an algorithm ? 10. Define NP-Class. 90159 2 PART-B (6x18=65 Marks) 11, a) Construct DFA equivalent to NFA (fp, a, r, s}, {0, 13, 8, p, {s}), where 8 is defined as (OR) b) Give non-deterministic finite automata accepting the set of strings in (0 + 1)* such that two 0's are separated by a string whose length is 4i, for some i> 0. 12. a) i) Prove that any language accepted by a DFA can be represented by a regular expression. ii) Construct a finite automata for the regular expression 10 + (0 + 11)0*1. (OR) b) Prove that the following languages are not regular : i) we fa,b}* lw=w i) Set of strings of 0's and 1’s, beginning with a 1, whose value treated as a binary number is a prime. 18. a) Suppose L = L(G) for some CFG G = (V, T, P, S), then prove that L — {e} is L(G’) for a CFG G’ with no useless symbols or € -productions. (OR) b) Prove that the languages accepted by PDA using empty stack and final states are equivalent. 14, a) State and prove Greibach normal form. (OR) b) Design a Turing machine to compute proper subtraction. ” @ ” 6) (A a 90159 16. a) Prove that Post Correspondence Problem is undecidable. (OR) b) Prove that the universal language L, is recursively enumerable but not recursive. PART-C (1x15=15 Marks) 16. a) i) Suppose L = N(M) for some PDA M, then prove that Lis a CFL. @ ii) Give a CFG for the language N(M) where M = ({q,, 4}, {0, 1}, {Zy, Xs 8s doy Z, ) and 8 is given by By 1, Z,) = {Ay XZ} Bay €, Z,) = {dy €)} (dy 1, X) = {ay XO} Sa, 1, X)= (a, )} (dy, 0, X) = (C4, X)} 8(a,, 0, Z,) = (ay, Zo} ® (OR) b) i) Design a Turing machine to compute multiplication of two positive integers. (8) ii) Design a Turing machine to recognize the language {0"1"0"|n2 Qe. mM soot sire PAG it 7 ding el iret sl al ae Sd op, eet © gia ere) me r - en Pee ee eee 0 at Saget ? , a ; bit =e Fd : eee Oa i HY Se

You might also like