1.

Answer the following

i. What is the difference between ID of PDA and TM?
ii. When a language L is said to be Turing recognizable? When a language L is said to be
Turing decidable?
iii. Explain Church-Turing hypothesis.
iv. Define recursive and recursively enumerable languages.
v. Define LBA and Context-sensitive language.
vi. Define Universal Turing Machine.
vii. When a language L
1
is said to be mapping reducible to language L
2
?
viii. Differentiate between TM and FA.
ix. What is PCP?
x. Define Turing Computable function.
xi. Show the relationship among P, NP, NPC and NP-hard.
2. a) Write down the CYK algorithm.
b) Explain Chomsky hierarchy in detail.
3. a) Design a PDA for the language L={a
n
b
2n
|n>0}
b) Design a TM for the language L={a
n
b
2n
|n>0}
4. a) Define primitive recursive function. Show that f(x,y)=x
2
y
4
+7xy
3
+4y
5
is primitive recursive.
b) Define Ackermans function. Compute A(1,5)
5. a) Explain with an example how to find out Godel number of a graph.
b) Show that f(x)=x/2 is a partial recursive function over N.
6. Show that union of two recursively enumerable languages is recursively enumerable and the
union of two recursive language is recursive.
7. Does the PCP with W=(1,10111,10) and X=(11,10,0) have a solution?
8. Design a PDA for the language L={WW
R
|W(0+1)*}
9. Define A
CFG
and prove that it is decidable.
10. Design a TM for subtraction of two integers.
Gandhi Engineering College
Bhubaneswar
Year Semester Branch Section
Staff Name: P.K Sahu 2011 5th CSE B
Department: CSE Subject: TC Code:PECS5304 Assignment:III
Course Name: B.Tech Date: 22-12-11