Answer
Constructing a Turing machine with tape symbols 0, 1,
and B that, given a bit string as input, replaces all but
the leftmost 1 on the tape with 0s and does not change
any of the other symbols on the tape.
Work Step by Step
Turing machine with tape symbols 0, 1, and B that, given a bit string as input, replaces all but the leftmost 1 on the tape with 0s and does not change any of the other symbols on the tape. will be as follow
(s0, 0, s0, 0, R),
(s0, 1, s1, 1, R),
(s1, s1, 0, R),
(s1, 1, s1, 0, R)
