Construct a Turing Machine that recognizes the set $\{0^{2n}1^n|n\geq 0\}$
Here is a Turing machine on the online simulator I found here.

name: Recongnize 0^2n 1^n
init: s0
accept: acc

s0, 0
s1, _, &gt;

s1, 0
s2, _, &gt;

s2, 0
s2, 0, &gt;

s2, 1
s2, 1, &gt;

s2, _
s3, _, &lt;

s3, 1
s4, _, &lt;

s4, 0
s4, 0, &lt;

s4, 1
s4, 1, &lt;

s4, _
s0, _, &gt;

s0, _
acc, _, -


The idea is to delete the two zeroes on the left, got to the end on the right, delete one, go to the way to the left, repeat. Accept only when after deleting 1 on the right the tape is empty.