Arithmetics properties of substitutions and infinite automata (Q2372784): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:54, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Arithmetics properties of substitutions and infinite automata |
scientific article |
Statements
Arithmetics properties of substitutions and infinite automata (English)
0 references
1 August 2007
0 references
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\).
0 references
infinite words
0 references
substitutions
0 references
automata
0 references
uniform distribution modulo 1
0 references