Uniformly balanced words with linear complexity and prescribed letter frequencies

Valérie Berthé, Sébastien Labbé

We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying th…