Morphic words and equidistributed sequences (Q2283040)

For an aperiodic (uniquely ergodic) one-sided shift \((X,\sigma)\) defined by a primitive substitution (or morphism) \(\varphi\) on an ordered alphabet \(A\), the authors consider the map \(\nu\) assigning to each \(w \in X\) the measure of all lexicographically smaller words. The sequence \(N(w) = (\nu(\sigma^n w))_{n\in\mathbb{N}}\) is then uniformly distributed on \([0,1]\) for all \(w \in X\). When \(\varphi\) is order-preserving and \(\{\sigma^n \varphi([a]): a\in A,0\le n|\varphi(a)|\}\) forms a partition of \(X\) into intervals, the authors give a morphism \(f\) on an extension of \([0,1]\) such that \(f \circ N = N \circ \varphi\). Then, for the fixed point \(w\) of \(\varphi\) starting with the smallest letter in \(A\), the sequence \(N(w)\) is the fixed point of \(f\) starting with \(0\). A construction for arbitrary binary substitutions is also given, together with a computer program.