I have been trying to find a multitape Turing Machine in order to accept a input string which consists on 0's and whose length is a power of 2:
However, Im getting troubble finding it, because I dont really know how to take the procedure with, for example, 2 tapes. I have found one solution for singletape, which is:
I have thought of 2 tapes. The first one will contain the contents of the 0's chain. The second tape will be used to copy the first half of the 0's of the first tape. In this way, every time we do this $copy$ process, we will make an analysis of the length of the resulting secondary string.
