hw7 - ECS 120: Introduction to Theory of Computation...

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

View Full Document Right Arrow Icon
ECS 120: Introduction to Theory of Computation Homework 7 Problem 1. A Stay-put Turing Machine is defined as a TM which after reading/writing to a tape cell can move the tape head either left, right, or leave it put in the same cell. Show that a Stay-put TM is equivalent to a TM. (Hint: Consider adding states to the finite control.) Problem 2. Show that a k -stack PDA (a k -PDA), for k 2 is equivalent to a Turing Machine. Problem 3. Specify fully a Turing Machine for the language { ww R | w ∈ { a,b } * } . Problem 4. Prove that a language L is decidable if and only if some enumerator enu- merates L in lexicographic order. Bonus A k-pebble machine
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/29/2010 for the course ECS 222 taught by Professor Mr. during the Spring '10 term at UC Davis.

Ask a homework question - tutors are online