Create a multitape turing machine with THREE tapes. Be sure to submit a .jff file not an image. The alphabet is 0, 1, and null. The number of characters on tape 0 and tape 1 is identical, tape 2 is empty. Tape 0 and tape 1 begin with (0+1)*. Fast forward to the far right of both tape 0, tape 1. Then treat them as if they are performing binary addition and write the solution on tape 2. Remember you need to write the solution from right to left, not left to right, the same order in which you should be reading the inputs from tape 0 and tape 1. Remember the carry-state and non-carry state that we used in class.

/in /by

Create a multitape turing machine with THREE tapes. Be sure to submit a .jff file not an image. The alphabet is 0, 1, and null.   The number of characters on tape 0 and tape 1 is identical, tape 2 is empty. Tape 0 and tape 1 begin with (0+1)*. Fast forward to the far right of both tape 0, tape 1. Then treat them as if they are performing binary addition and write the solution on tape 2. Remember you need to write the solution from right to left, not left to right, the same order in which you should be reading the inputs from tape 0 and tape 1.   Remember the carry-state and non-carry state that we used in class.