How to implement a turing machine that converts the input from binary to unary?
Example: given input-$101 The output should be -1^5=11111
How to implement a turing machine that converts the input from binary to unary?
Example: given input-$101 The output should be -1^5=11111
The problem statement does not specifically request a single-tape Turing machine, which greatly simplifies matters. Since we know that multi-tape Turing machines have equivalent single-tape machines to which they correspond, we'll just worry about the multi-tape definition and leave transforming it to a single-tape variety as an exercise.
We will use a three-tape Turing machine that works as follows:
Example of how this would work: