Scribd
Upload
10 views2 pages

Question Paper Code

This document is a question paper for the B.E./B.Tech. degree examinations in Computer Science and Engineering for the Theory of Computation course. It includes various parts with questions on finite automata, regular languages, context-free grammars, Turing machines, and computational complexity. The exam is structured into three parts with a total of 100 marks and covers both theoretical concepts and practical applications.

Uploaded by

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

Question Paper Code

This document is a question paper for the B.E./B.Tech. degree examinations in Computer Science and Engineering for the Theory of Computation course. It includes various parts with questions on finite automata, regular languages, context-free grammars, Turing machines, and computational complexity. The exam is structured into three parts with a total of 100 marks and covers both theoretical concepts and practical applications.

Uploaded by

ykisanth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

*X20402* Reg. No.

Question Paper Code : X 20402


B.E./B.Tech. Degree Examinations, november/december 2020
Fifth/Eighth Semester
Computer Science and Engineering
CS6503 – theory of computation
(Common to : Information Technology)
(Regulations 2013)

Time : Three Hours Maximum : 100 Marks

Answer all questions

Part – A (10×2=20 Marks)

1. Find the set of strings accepted by the finite automata.

2. Prove that L = {aibi | i ≥ 0} is not regular.

3. Difference between regular expression and regular language.

4. Consider the following grammar G with productions.


S → aaSb
S → λ

5. State the pumping lemma for CFLs.

6. Design a DFA to accept the language. L = {w/w is of even length and begins with 01}.

7. Define Turing machine.

8. What is halting problem ?

9. How to prove that the post correspondence problem is undecidable ?

10. Differentiate NP-hard and NP-completeness problem.


X 20402 *X20402*
Part – B (5×13=65 Marks)
11. a) Convert the following NFA into DFA. (13)


Following are the various parameters for NFA
Q = {q0, q1, q2}
∑ = (a, b)
F = {q2}
δ (Transition Function of NFA)
(OR)
b) i) Construct a minimized DFA from the regular expression :
(11)* + (111)*. (8)
ii) Discuss the application of finite automata. (5)
12. a) Is the following grammar is ambiguous ? Justify your answer. (13)
E→ E + E | id.
(OR)
b) Convert Context Free Grammar (CFG) into Greibach Normal Form (GNF). (13)
G1 = {S→aA|bB, B→bB|b, A→aA|a}
G2 = {S→aA|bB, B→bB|ε, A→aA|ε}

13. a) Define the pushdown automata for language {anbn |n > 0}. (13)
(OR)
b) Describe the Equivalence of pushdown automata and CFL. (13)

14. a) Explain multi head and multi tape turing machines. (13)
(OR)
b) i) Design a turing machine which reverses the given string {abb}. (8)
ii) Describe the programming techniques for TM. (5)

15. a) i) Write short notes on primitive recursive functions. (8)


ii) Give an account on NP completeness. (5)
(OR)
b) i) Explain the difference between tractable and intractable problems with examples. (9)
ii) Give an example of undecidable problem. (4)
Part – C (1×15=15 Marks)

16. a) Obtain a Greibach normal form grammar equivalent to the context free
grammar 0 | AA S → 1 | SS A → (15)
(OR)
b) Construct the Turing machine for the language { } 1 | 0 1 ≥ = n L n n. (15)
–––––––––––––

You might also like