cs373 fa10 hw7 - Practice Problems Solve problems 3.15(a...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Problem Set 7 CS 373: Theory of Computation Assigned: October 19, 2010 Due on: October 26, 2010 at 10am Instructions: This homework has two parts. The first part has practice problems from the textbook many of whose solutions can be found in the textbook itself; you must not turn in solutions for these. The second part has 3 problems that can be solved in groups of size at most 3. Please strictly follow the homework guidelines given on the class website; submitions not following these guidelines will not be graded. Recommended Reading: Lectures 15 and 16 and Chapter 3 and 4 of class textbook.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Practice Problems Solve problems 3.15(a), 3.16(a), 4.1, 4.5, 4.9, 4.11, 4.21, and 4.23. Homework Problems Problem 1 . [Category: Proof] Solve problem 3.19. Hint: Use the result of problem 3.18, which was solved in discussion 9. Problem 2 . [Category: Proof] Solve problem 4.17. Problem 3 . [Category: Proof] Consider Inf = { M | M is a TM and L ( M ) is infinite } . Using reduc-tions, prove that Inf is not recursively enumerable (i.e., Turing recognizable). Hint: Reduce a known non-recognizable language like A TM or L d to Inf. 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online