Mauduit, Christian Automates finis et équirépartition modulo 1. (Finite automata and uniform distribution modulo 1). (French) Zbl 0565.10030 C. R. Acad. Sci., Paris, Sér. I 299, 121-123 (1984). 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 Cited in 3 Documents MSC: 11J71 Distribution modulo one 68Q45 Formal languages and automata 11K06 General theory of distribution modulo \(1\) Keywords:uniform distribution; finite automaton PDFBibTeX XMLCite \textit{C. Mauduit}, C. R. Acad. Sci., Paris, Sér. I 299, 121--123 (1984; Zbl 0565.10030)