AVS COLLEGE OF TECHNOLOGY, SALEM-106

Department of CSE
ICT -1
Semester & Branch: IV / CSE Time: 3.00 Hours Date:24.5.24
Subject Code/Name:CS3452/Theory of Computation Max. Marks: 100
PART A (10x2=20)
Answer all the Questions
1 List down a few properties of recursively enumerable set.
2 Define class P and NP Problems. Give Example
3 When is a language L is recursively enumerable?
4 What are NP hard problems?
5 What are recursive languages?
6 Identify whether ‘Tower of Hanoi’ problem is tractable or intractable. Justify your answer
7 Distinguish between PCP and MPCP? What are the concepts used in Universal Turing
Machine.
8 Illustrate about Time and Space complexity of TM?
9 Describe Post Correspondence Problem.
10 Formulate the 2 problems of recursively enumerable sets which are undecidable?

PART B (5X13=65)Answer all the Questions

11 a) Discuss on the time and space complexity of a TM with e.g 13
(or)
b) Give short notes on Recursive and Recursive Enumerable languages 13
12 a) Show that the union of two recursive language is recursive and union of two RE 13
language is recursive.
(or)
b) i) Prove that Universal language Lu is recursively enumerable but not recursive 7
ii) Compare the difference between recursive and recursively enumerable 6
(or)
13 a) Prove that Post Correspondence problem is undividable 13
(or)
b) What is PCP? Explain with the help of an example. 13
14 a) Explain decidable and undividable problem with an example 13
(or)
b) Describe about Recursive and Recursively Enumerable languages in detail. Also 13
discuss the properties of recursively Enumerable in detail.
15 a) Discuss post correspondence problem. Let ∑={0,1}.Let A and B be the list of three
strings each, defined as
List A List B
i wi xi
1 1 111
2 10111 10
3 10 0
 7
i)Does the PCP have a solution 6
ii)Show that the diagonalization language(Ld)is not recursively enumerable

(or)
b) i) State and describe Rice Theorem 6
ii) Show that the characteristic function of the set of all even number is recursive 7
PART C -(1X15 =15)
16 a) Consider and find the languages obtained from the following
i)Union of two recursive language 6
ii)Union of two recursively enumerable languages 7
iii)Define NP hard and NP completeness Problem 2
(or)
b) i) 8

Subject In-Charge HOD IQAC PRINCIPAL

 AVS COLLEGE OF TECHNOLOGY, SALEM-106
Department of CSE
ICT -2
Semester & Branch: IV / CSE Time: 3.00 Hours Date:27.05.24
Subject Code/Name:CS3452/Theory of Computation Max. Marks: 100
PART A (10x2=20)
Answer all the Questions
1 What is a deterministic Push Down Automata
2 Write a context free grammar for the language consisting of equal number of a’s and b’s.
3 When do you say CFG is ambiguous?
4 Define Pushdown Automata.
5 Derive a string ‘aababa’ for the following context free grammar
SaSX/b
XXb/a
6 Tabulate the difference between Chomsky Normal Form(CNF)and Greibach normal
Form(GNF)
7 Give the philosophybehind Pumping lemma for CFLs
8 Give the instantaneous description of a TM.
9 What do you mean by useless symbol? Explain with an e.g.
10 What are the three ways to simplify a context free grammar?
PART B (5X13=65)
Answer all the Questions
11 a) i) Construct a PDA for the language {WCW R/Wε{0,1} 8
ii) Construct a CFG for the constructed PDA 5
(or)
b) i) Let G=(V,E,R,S) be the CFG, where V={A,B,S} E={a,b} ,S is the start variable
and R consist of the rules
SaB|bA
Aa|aS|BAA
Bb|bS|ABB
i)Prove that ababbaε L(G) 7
ii)Prove that L(G)bis the set of all non-empty strings w over the alphabet{a,b} such
that the number of a’s in w is equal to the number of b’s in w. 6
12 a) Construct a CFG for the language given below
L(G)={w|wε(a,b) + and w is an odd length palindrome}.Also check whether 13
w=’babab’ is a valid string or not.
(or)
b) Construct an empty store Push Down Automata(PDA) for the below mentioned
language.
L(G)={w|w ε (a,b) } and w is of the form a n b n and n>=1}.Also mention the state 13
transitions of this PDA while parsing the string w=’aaabbb’
13 a) Convert the grammar S0S1/A
A1A0/S/ε into PDA that accepts the same language by empty stack.Check 13
 whether 0101 belongs to N(M)
(or)
b) Construct the PDA accepting the language L={a n b n/n>0}by empty stack and final 13
state.
14 a) Construct a Turing machine to accept the following language 13
L(G)={w|w ε (0,1) and w is of the form 0 n 1n where n>=1
(or)
b) i) Convert the following grammar into CNF
SASB|ε
AaAS|a 7
BSbS|A|bb
ii) Design a Turing Machine to compute proper subtraction 6
15 a) i) Convert the following grammar into GNF. 7
A1A3A2|A2A3
A2A3A3|A2A2|a
A3A2A2|b
ii) Design a Turing machine that takes a binary number as input and increments the 6
number by 1
(or)
b) Design a TM which recognizes palindrome over alphabet {a,b}.Trace the 13
strings”abab”and “baab”
PART C -(1X15 =15)
16 a) i) Write the regular expression for the set of all strings of 0’s and 1’s not containing 5
101 as substring.
ii) Design a TM to recognize the language {0 n 1n 0n|n>=0} 10
(or)
b).i Convert the grammar S

0S1/A,A
1A0/S/ into an equivalent PDA and check whether 0101 belongs to it. 8
ii Construct an appropriate model to recognize the language L defined by

L={an bm c m d n/n,m>=0} 7

Subject In-Charge HOD IQAC PRINCIPAL

 AVS COLLEGE OF TECHNOLOGY, SALEM-106
Department of CSE
ICT -3
Semester & Branch: IV / CSE Time: 3.00 Hours Date:29.5.24
Subject Code/Name:CS3452/Theory of Computation Max. Marks: 100
PART A (10x2=20)
Answer all the Questions
1 Differentiate NFA and DFA
2 Define Deterministic Finite Automata
3 What is Proof by contradiction
4 Prove 1+2+3+…..+n=n(n+1)/2 using Induction method.
5 Draw a NFA to accept strings containing the substring 0101.
6 Design a FA which accepts odd number of 1’s and by any number of 0’s.
7 Convert the given NFA to an DFA

8 Prove that reversal of any regular language is also regular.

9 Write a regular expression that recognizes the set of all strings(0+1)* that do not contain the
substrings 00 & 11 over the alphabet ∑={0,1}
10 Write regular expression to recognize the set of strings over{a,b} having odd number of a’s
and b’s that starts with ‘a’.
PART B (5X13=65)
Answer all the Questions
11 a) Construct NFA accepting the set of strings ∑={0,1} such that two 0’s are separated 13
by a string whose length is 4i,for some i>=0
(or)
b) Prove that for every L recognized by an NFA there exists an equivalent DFA
accepting the same language L. 13

12 a) Construct a DFA for the following language and check whether w=’01101’ is a 13
valid string or not.
L(G)={w|w ε(0,1) and w starts with 1 and have even length.
(or)
b) Explain the DFA minimization algorithm with an example 13
13 a) Convert the following NFA with ε, to a NFA without ε.
0 1 2 ε
qo {qo} {φ} {φ} {q1}
(start) 13
q1 {φ} {q1} {φ} {q2}

*q2 {φ} {φ} {q2} {φ}

(or)
 b) Convert a DFA ,the following NFA

a b
p(start) {p} {p,q} 13
q {r} {r}
r {φ} {φ}

14 a) i) Design a PDA that will accept strings(a+b)* in which the number of a’s is greater 7
than the number of b’s given the alphabet ∑={a,b}
ii) .Convert the above PDA to its equivalent CFG 6
(or)
b) Prove that the set of regular language is closed under complementation (i.e).If L is a
regular language then L’ is also a regular language. Give an Example. 13
15 a) Convert the following NFA into R.E 13

(or)
b) Construct a finite automata for the R.E 10 + (0+11) 0* 1 13

PART C -(1X15 =15)

16 a) Consider the NFA N= (Q,∑,δ,q,F) where Q={1,2,3},∑={a,b} q=1,F={2} and δ is
given by the following table.

a b c

1 {3} φ {2}

2 {1} φ φ

3 {2} {2,3} φ 15
Convert the NFA (N) into DFA (M) that accepts the same language.
(or)
b) Convert the following to regular expression 15
Subject In-Charge HOD IQAC PRINCIPAL