ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE B.E./ B.TECH.

DEGREE EXAMINATIONS: APRIL / MAY 2011 REGULATIONS: 2008 FIFTH SEMESTER: INFORMATION TECHNOLOGY 080250018 - THEORY OF COMPUTATION TIME: 3 Hours PART-A (20 x 2 = 40 MARKS) ANSWER ALL QUESTIONS 1. 2. 3. 4. 5 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. What is finite automaton? Give two examples. Distinguish between NFA and DFA. What is the language represented by set L(aa* + aba*b*)? What is an automaton with output? Give an exa'mple. Generate the CFG for the language L What is meant by derivation? Define the instantaneous descriptitln of PDA Define GNF. What is meant by Turing machine? Define the Turing machine halting machine. List out the techniques for Turing machine construction. What is multiple track Turing machine? Define recursive language. Max.Marks : 100

= {0*1*}.

When a language is said to be recursively enumerable? State Rice theorem.

Mention any tow undecidaQility properties of REL. Distinguish between time and space complexities.

What are tractable problem?

What is an intractable problem? Give two examples.

do w

nl o

ad

ed

Define NP - Complete problem.

fro m

re j

in

pa ul .c

om

3! + . 4 8 23 a) Find a deviation tree of a * b + a * b given that a * b + a * b is in L(G). a) Prove the following by principle of induction. b)Show that L = {On 10 n . a) Show that the language L and its complement L' are both recursively enumerable then L is recursive... A → aab IE. + n. S → S * S... 6 6 I n≥1} is not regular 22.... a) b) Discuss the models of Turing machines.. b)Construct a NFA that accept the set of all strings {a. 26.. S → bba 8 " 24 . where G is given by S → S + S. S → a / b 4 b) Find the CNF for the following grammar S → AS I as.2! +3. Design PDA for the language L = {a b 3n 25 n I n≥O} and simulate its action on the input string aaaaaabb.a) Discuss about the Chomsky hierarchy of languages. n> 1.PART .c om . 1.8 (5 x 12 = 60 MARKS) ANSWER ANY FIVE QUESTIONS 21. fro m b) Explain the halting problem Is it decidable or undecidable problem do w nl o ad ed re j 6 in 6 Show that the language L = {an b c d n n n I n≥O} is not CFL 6 6 pa ul .1! + 2.n! = (n+1)!-1. b} ending with "aba" as substring and construct DFA..

b)Write a note on NP .c om 28.Completeness. Write a short notes on the following a) Universal Turing machine b) Post Correspondence Problem 6 6 by the reduction of a problem p1. a) Prove that a problem p2 cannot be solved in polynomial time can be proved 6 . which is under class p1 to p2.27. 6 *****THE END***** ad do w nl o ed fro m 3 re j in pa ul .