Consider the language L₁ = {w₁#w₂ | w₁ {0, 1}^* and w₂ {0, 1} such that [w₂] = 3 [w₁] and |w₁| = |w₂|}.

Consider the language L_1 = {w_1#w_2|w_1 elementof {0, 1}* and w_2 elementof {0, 1}* such that [w_2] = 3 times [w_1] and [w_1] = [w_2]}. Here, for a string w, [w] represents the value of the string with first bit as the least significant bit. For example [0011] = 12, [101] = [1010] = 5, and [001] = 4. Therefore,0010#0011 elementof L_1. Give a single tape turing machine that recognizes L_1