I know how a Turing machine works, how it accepts a language but in some.In some scenarios we would like to use counters.For example, I want to develop a machine that accepts $\{0^{2n} : n \geq 0\}$. How can I count the number of zeroes?If some one of you could solve the following problem for me it would help my understanding of these matters:Design a Turing machine for $L = \{1^{3^n} : n \geq 1\}$.
Counters in Turing machines
turing machines