Give the Turing machine transition table for a TM that accepts the language: $\{x ∈ \{0, 1\}^∗| \text{x begins with 0 and has as many 1 to 0 transitions as 0 to 1 transitions}\}$
Attempt:
Algorithm:
1)If it sees a 0 then move all the way down to the right until it finds a 1 and then keep moving right to find a 0.
2) Accept the string if the initial step is fulfilled
3) Repeat the same process.
