Scribd
Upload
22 views2 pages

RTU Paper 2009

Uploaded by

purva
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
22 views2 pages

RTU Paper 2009

Uploaded by

purva
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

*8023* (Pages : 2) 8023

Reg. No. : .....................................

Name : ..........................................

Sixth Semester B.Tech. Degree Examination, December 2009


(2003 Scheme)
Branch: Computer Science
03-603: THEORY OF COMPUTATION (RF)

Time : 3 Hours Max. Marks : 100

PART – A

Answer all questions. Each question carries 4 Marks.


1. Define a DFA and NDFA.
2. What is a Regular Expression ?
3. Draw an automaton given by the language D = { x ± {(0*1*)}}
4. Differentiate Mealy and Moor machines.
5. Define Halting of a Turing Machines.
6. Obtain the DFA for the given NFA.

7. Define recursive and recursively enumerable languages.


8. Explain the satisfiability problem.
9. Define a Turing Machine and Turing Compatability.
10. What is meant by ambiguity in languages ? (10×4=40 Marks)
P.T.O.
8023 -2- *8023*
PART – B

Answer all questions. Each question carries 20 Marks.

Module – I

11. a) Design a minimal state DFA accepting D = (01+(0+11) 1*0)*11.

b) For a given CFG such that S ‘ aB/bA, A ‘ aS/bAA/a,B ‘ bS/aBB/b prove


*
that if S Á w, then W contains equal number of ‘a’s and ‘b’s.
OR

12. a) Prove that the family of regular languages is closed under intersection.

b) Find a DFA for the language L = {anbm/ m – 2, m – 1}

Module – II

13. a) Construct a PDA to accept the language L = {an bn / n – 0} for the final state.

b) Check whether the language L = {anbncn, for n – 0} is a CFG or not, using


pumping lemma.
OR

14. a) Discuss with suitable examples the closure properties of CFLs.

b) Explain the classification of languages as per the Chomsky Hierarchy.

Module – III

15. a) State and prove the theorem of single tape Turing Machine with a Multitape
Turing Machine.

b) Design a TM to recognize the language L = {0n 1n 0n for n – 1}


OR

16. a) How to describe a Turing Machine as a Computer of integer functions ?

b) State and prove the theorem of equivalence of single tape with a multitape
Turing Machine. (20×3=60 Marks)

——————

You might also like