On \((\epsilon,k)\)-normal words in connecting dynamical systems (Q1104969)

It was shown by \textit{A. Copeland} and \textit{P. Erdős} [Bull. Am. Math. Soc. 52, 857-860 (1946)] that a real number \(\alpha\) of the form \(\alpha =.a_ 1a_ 2...,\) obtained by catenating the base \(g\) (\(g\geq 2\); integer) digit blocks of a sequence \(a_ 1<a_ 2<..\). of integers, is normal if the \(a_ n\) satisfy a certain growth condition (example: primes). The authors generalize this result to infinite words obtained by catenating words from a language over a finite alphabet, satisfying a certain ``connecting condition'' (For any two words a, b there exists a word u of bounded length such that aub is a word). In particular, this leads to a generalization of the Copeland-Erdős Theorem to digit expansion with a Pisot number as base.