Honors Theory of Computation, Spring'00.

HOMEWORK 4:

Out: Feb 29
Due: Mar 8

	==================================================	
	INSTRUCTIONS:  Answer each question within the page 
	limitation specified.  Use reasonable size 
	handwriting and leave a 1-inch margin for grading.
	If necessary, summarize your method or arguments.
	==================================================	

(Q0) PLEASE DO THE FOLLOWING QUESTIONS FOR PRACTICE
	(DO NOT SUBMIT, AS THEY WILL NOT BE GRADED)

	--Page 67, Problem 3.4.4 (non-repeating enumeration)
	--Page 67, Problem 3.4.5 (length-increasing enumeration)
	--Page 67, Problem 3.4.6 (s-m-n theorem)
	--Page 155, Problem 7.4.6 (Kleene star)

(Q1) Page 68, Problem 3.4.8 (recursion theorem)

	LIMIT: 1/2 page.

(Q2) Page 211, Problem 9.5.19.  NP-completeness of
	of 2 node-disjoint path of bounded length.

	LIMIT: 1/2 page.