I am currently making a 2 tape turing machine for a language that has a binary palindrome (ex: L = {x is over {0,1} | x is a palindrome }. I can assume that the tape is only infinite in one way (the right side). and when using 2 tapes, the first one contains the input, the other is empty, and both heads start at the beginning of the tape.
So, my process has been:
- transfer all of the letters from tape1 to tape2 (ex: 0,0,R | U,0,R would keep the symbol 0 on tape1 and move it to the right while changing the empty symbol on tape2 to 0 and moving it right as well).
- Reverse tape1's head to the start again. However, I'm not sure how to do this if the tape is not infinite on both sides. I've been stumped on this part for a while and am unsure of how to continue.