I want to create a diagram of a turing machine that decides the following language.
$\{w \in $ $\{a,b\}^*: w = u^n, u \in \{a,b\}^+, n \geq 2\}$
The diagram I had planned to make was a very simple one, but I don't know if it would meet the goal of making the machine Turing-decidable.
The problem can be solved with non-deterministic and multiple tapes.