This preview shows page 1. Sign up to view the full content.
Unformatted text preview: M . d. List the sequence of configurations (instantaneous descriptions) that M enters for each of these two inputs: i. 010110 (which M should accept); ii. 101001 (which M should reject). 2. (26 points) Turing Machine Design: Textbook Exercise 3.8(c) on p. 160. 3. (26 points) Turing Machine Design: Provide an implementationlevel description of a Turing Machine M ' that is given, as input, a string over the alphabet {0,1} which originally appears on the tape preceded by the character s . Assume that the string is known to be of even length. Thus, the input on the tape is of the form: n w w sw 2 2 1 L followed by blanks, where ≥ n and w i is in {0,1} . M ' s hould find the middle of the string, insert the character c there, and then halt. Upon halting, the tape should therefore contain: n n n w cw w w sw 2 1 2 1 L L + followed by blanks . 4. (24 points) Closure : Textbook Exercise 3.16(d) on p. 161 ( Σ 1 closure under intersection) ....
View
Full
Document
This note was uploaded on 02/13/2012 for the course CS 91.304 taught by Professor Staff during the Fall '11 term at UMass Lowell.
 Fall '11
 Staff
 Computer Science

Click to edit the document details