Single tape turing machine for converting binary number to unary?

Question

I'm stuck on a problem I've been trying to solve, namely converting a binary number with no leading zeros to a unary representation on the same tape.

E.g. 110 -> xxxxxx

I found markov's algorithm as a potential solution, but am unable to implement it. Would appreciate some direction!

Edit: figured it out on my own. Write a machine for binary subtraction, then write an x for each subtraction.

Do you have a specific question to ask us? What do you expect us to say that you didn't already find? — user2357112, Feb 15 '17 at 00:24
I'm voting to close this question as off-topic because it's about pure CS theory, which is a better fit at cs.stackexchange.com. — templatetypedef, Feb 15 '17 at 02:22

score 0 · Answer 1 · answered Apr 18 '21 at 15:49

0

1 q0:q1 0 R
1 q1:q1 1 R
0 q1:q1 0 R
  q1:qRev | L
| q1:q1 | R
0 q0:qCon # R
0 qCon:q00 0 R
1 qCon:q00 1 R
| qCon:! | S
0 q00:q00 0 R
1 q00:q00 1 R
| q00:q00 | R
  q00:qMul   L
|* qMul:qMul |* L
| qMul:qMul1 |* R
|* qMul1:qMul1 |* R
  qMul1:qMul |* L
1 qMul:qBea 1 R
0 qMul:qBea 0 R
|* qBea:qBea | R
  qBea:qRev   L
| qRev:qRev | L
1 qRev:qRev 1 L
0 qRev:qRev 0 L
# qRev:q0 # R
  qRev:q0   R

answered Apr 18 '21 at 15:49

Dima Shtrikker

1
1

2

This answer does not explain why it works, how can one learn from it? – GooDeeJAY Apr 18 '21 at 18:43

Single tape turing machine for converting binary number to unary?

1 Answers1