Task 1: Binary to unary

Construct a Turing Machine which transforms a number from binary to unary notation.
Example:
The binary number 101 equals 11111 in unary notation.

Initial condition
The binary number is enclosed by #-symbols. The read/write-head starts on the #-symbol on the right.


World before program execution



Hint: Make sure that the world is wide enough!

Task 2: Unary to binary

Construct a Turing Machine which transforms a number from unary to binary notation.

Initial condition
The unary number is enclosed by #-symbols. The read/write-head starts on the #-symbol on the right.


World before program execution