0

I'm trying to answer the third part to the following question:

enter image description here

I have drawn the following state diagram:

enter image description here

According to the solution, the machine "adds 1 to a binary number with its least significant bit in the leftmost position on the tape". I am unsure what this means and can't see why it is the case.

With input 111, the Turing machine outputs 0001. In this case, the solution mentioned above would imply that the machine adds 1 to 111 since its least significant bit, 1 (?), is in the leftmost position on the tape. However this would give 1000. If the solution is correct then it must imply 000 +1 but I don't see how this is the case?

How do I reason about this Turing machine?

kw3rti
  • 204
  • 2
  • 11

1 Answers1

0

The turning machine performs binary addition. The numbers are just written with the LSB in the left most position (I.e. backwards). So 111 == 1110 not 0111, and 111 + 1 == 0001 not 1000.

In q0 tape head is on 0 (or is empty) then it simply replaces the 0 with a 1 goes to the end of tape and accepts. This clearly adds 1.

In q0 if tape contains a 1 we replace that 1 with a 0. The transition from q2 to q2 carries the 1. The transitions from q2 to q3 and q2 to q1 "end" the carrying operation (your diagram is missing a transition from q2 to q3 of the form _;1,R).

So the answer is correct.

AltF4
  • 86
  • 6