×

Automates finis et équirépartition modulo 1. (Finite automata and uniform distribution modulo 1). (French) Zbl 0565.10030

Let \((a_ n)\), \(n\in {\mathbb{N}}\), be a sequence recognizable by a finite automaton. A certain condition on the graph of the automaton guarantees that for any irrational x the sequence \((a_ n x)\), \(n\in {\mathbb{N}}\), is uniformly distributed mod 1.
Reviewer: F.Schweiger

MSC:

11J71 Distribution modulo one
68Q45 Formal languages and automata
11K06 General theory of distribution modulo \(1\)
PDFBibTeX XMLCite