Preprint
Jul 2026
Superlinear complexity of the $(3/2)^n$ steering word
It is proved that the subword complexity $p_{T}(k)$ of $T$ is superlinear, $p_{T}(k)/k\to\infty$.
R. Stephan
· 1 citation