This preview shows pages 1–2. Sign up to view the full content.
CS 154
Intro. to Automata and Complexity Theory
Handout 23
Autumn 2009
David Dill
October 20, 2009
Problem Set 4
Due: October 27, 2009
Homework:
(Total 100 points) Do the following exercises.
Problem 1.
[10 points]
In this problem you will establish some closure
properties for languages of Turing machines.
(a).
Are recursive languages closed under
intersection
? Justify your answer.
(b).
Are recursively enumerable languages closed under
intersection
? Jus
tify your answer.
Problem 2.
[20 points]
Consider the following problem concerning Turing
machines with a tape alphabet Γ.
Given a Turing machine
M
, input string
w
, and a symbol
X
∈
Γ,
decide whether
M
, when running on input
w
, will ever write the
symbol
X
on its tape.
Show that this problem is undecidable. Is this problem recursively enumer
able? (
Hint:
Can you give a reduction from the universal language
L
u
? It
may help to look at the solution to Exercise 9.3.7(a), although Exercise 9.2.1
is more directly relevant.)
Problem 3.
[20 points]
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 01/12/2010 for the course CS 154 at Stanford.
 '08
 Motwani,R

Click to edit the document details