Arithmetics properties of substitutions and infinite automata (Q2372784): Difference between revisions

The author studies arithmetical and statistical properties of infinite words and sequences of integers generated by a substitution on an infinite denumerable alphabet or by a deterministic automata with an infinite denumerable set of states. In particular, he proves that if \(u\) is a sequence of integers generated by an automaton whose associated graph represents a random walk with zero average on a \(d\)-dimensional lattice, then the sequence \((n\alpha)_{ n\in u }\) is uniformly distributed modulo 1 if and only if \(\alpha \in \mathbb R \setminus \mathbb Q\).