Scribd
Upload
59 views2 pages

Toc Apr 2008

This document contains an exam for a Computer Science and Engineering course covering topics in theory of computation such as automata, grammars, Turing machines, and computability. It includes 10 short answer questions in Part A and 5 longer questions in Part B involving constructing automata and grammars, proofs of language properties, and analyzing computational models.

Uploaded by

rajendra.raju
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
59 views2 pages

Toc Apr 2008

This document contains an exam for a Computer Science and Engineering course covering topics in theory of computation such as automata, grammars, Turing machines, and computability. It includes 10 short answer questions in Part A and 5 longer questions in Part B involving constructing automata and grammars, proofs of language properties, and analyzing computational models.

Uploaded by

rajendra.raju
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

Anna University

ul
.c

om

B.E/B.Tech DEGREE EXAMINATION APRIL/MAY 2008


Fifth Semester
Computer Science and Engineering
CS1303THEORY OF COMPUTATION
(Regulation 2004)
Time: 3 hours
Maximum marks: 100
Answer ALL questions
PART A (10 x 2 =20 marks)

pa

1.Define Automaton?

.re

3.Construct a DFA for the regular expression aa*/bb*..

jin

2.What is the principle of mathematical Induction?

4.Construct a DFA over =(a,b) which produces not more than 3 as.

5.Let S->aB/bA

fro

A->aS/bAA/a
B->bS/aBB/b
Derive the string aaabbabba as left most derivation.
6. What is meant by empty production removal in PDA.?

oa

7.State the Pumping lemma for CFG.

w
nl

8. Define turing machine

9.What is meant by halting problem.

do

10.What is post correspondence problem?


PART B (5 x 16 = 80)
11. (a ) (i) Prove that for every integer n>=0 the number 42n+13n+2 is a multiple of 13

(ii)construct a DFA that will accept strings on{a,b}where the number of bs divisible by 3
(or)
(b) (i) Construct a finite automaton that accepts the set of all strings in {a,b,c}* such that the last

symbol in input string appears earlier in the string


12 (a) (i) Construct the regular expression to the transition diagram.

om

Diagram
(or)
(b)Construct a NFA for regular expression (a/b)*abb and draw its equivalent DFA.

ul
.c

13. (a) Construct a CFG accepting L={ambn/n


(or)
(b)Convert the grammar with productions into CNF A->Bab/.

jin

pa

14.(a) Design a deteministicturing machine to accept the language L={aibici/i>=0}


(or)
14. (b)Determine whether the language given byL={An2/N>=1} is a context free or not.

do

w
nl

oa

fro

.re

15. (a)Prove that the function fadd (x,y)=x+y


is a primitive recursive
(or)
15. (b)Show there existsaTM for which the halting problem is unsolvable

You might also like