CSE 725 Spring, 2006 Homework 4 Due: Wednesday, May 17 (start of class)
1. Prove that the set K = cfw_ M property of languages. 2. Complete Case II of the proof of Rice's Theorem for decidable properties of languages. The situation is: Given: P is a decid
CSE 725 Spring, 2006 Homework 5 Due: Wednesday, May 24 (start of class)
1. Do homework exercises 7.5, 7.7, and 7.17 from the textbook (both editions).
p 2. Complete the reduction SATDP m 3SATDP by showing how to convert a conjunct with
exactly one literal
CSE 725 Spring, 2006 Homework 6 Due: Friday, June 2 (start of class)
If you have the 1st edition of the textbook, do problems 7.16, 7.19, 7.27 and 7.34 from the textbook. If you have the 2nd addition of the textbook, do problems 7.20, 7.21, 7.27, and 7.28
Grading Scale for CSE 725 Homework Assignments
Numeric score 5 4 3 2 1 0
What it means All graded answers were correct and well written. Graded answers were mostly correct and the writing was pretty good. Still, there is room for improvement. Average work
CSE 725 Spring, 2006 Homework 1 Due: Wednesday, April 12 (start of class)
If you have the 1st addition of the textbook, do exercises 3.1.a, 3.1.d, 3.4, 3.6, 3.7, 3.8.b and do problems 3.11, 3.14.b, 3.14.e, 3.15.b, 3.15.d, 3.16, and 3.19 from the textbook.
CSE 725 Spring, 2006 Homework 2 Due: Wednesday, April 26 (start of class)
1. Show that the set QT is decidable where
QT = cfw_ M , w w and M accepts w using at most w tape squares .
2
2. Show that the set NML is decidable where
NML = cfw_ M , w w and as
CSE 725 Spring, 2006 Homework 3 Due: Friday, May 5 (start of class)
1. If you have the 1st edition of the textbook do problems 5.12 and 5.13. If you have the 2nd addition of the textbook do problems 5.9 and 5.13. 2. Show that A is Turing-recognizable if a