1. (Part A) Consider the Turing machine Mi in Sipser's book page 173, Figure 3.10. My decides the language {www | WE {0,1}*}. Give the sequence of configurations that My enters when the input is 10#10. Note that the book uses some shorthand when the current symbol is not changed: . a R stands for a a, R; a, b + R stands for a +a, R and b 6, R. (Part B) Modify the Turing machine M in the previous question to do the following: takes as input a string of O's and l's, interprets it as the binary representation of a nonnegative integer r; leaves as output a binary representation of x +1. Solution: 1. (Part A) Consider the Turing machine Mi in Sipser's book page 173, Figure 3.10. My decides the language {www | WE {0,1}*}. Give the sequence of configurations that My enters when the input is 10#10. Note that the book uses some shorthand when the current symbol is not changed: . a R stands for a a, R; a, b + R stands for a +a, R and b 6, R. (Part B) Modify the Turing machine M in the previous question to do the following: takes as input a string of O's and l's, interprets it as the binary representation of a nonnegative integer r; leaves as output a binary representation of x +1. Solution