All Questions

For a positive integer $n$ I would like to construct long sequences consisting of 0, 1 and 2's such that for any two subsequences consisting of $n$ consecutive elements the number of 0's , 1's or 2'...

It is known that for a primitive substitution $S:\mathcal{A}\to \mathcal{A}^+$, there exists constants $c,C>0$ such that $$ c\theta_S^n \leq \vert S^n(a)\vert \leq C \theta_S^n \quad \text{for all} ...