Construct a Turing Machine which mirrors a given character string consisting only of zeros and ones.


Initial task (above), two possible solutions (below)

Initial condition

The character string is bounded by #-symbols on both sides. The read/write-head starts on the left #-symbol.

Hint

The mirrored character string does not have to be on the same row as the input. Consider if it helps to use multiple rows or additional symbols.