Distributing labels on infinite trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Distributing labels on infinite trees

Bruno Gaujal


Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly istributed as possible) and they can be constructed using a mechanical definition. All this properties make them good candidates for being extremal points in scheduling problems over two processors. In this paper, we consider the problem of generalizing Sturmian words to trees. The problem is to evenly distribute labels 0 and 1 over infinite trees. We show that (strongly) balanced trees exist and can also be constructed using a mechanical process as long as the tree is irrational. Such trees also have a minimal factor complexity. Therefore they bring the hope that extremal scheduling properties of Sturmian words can be extended to such trees, as least partially. Such possible extensions are illustrated by one such example.
Fichier principal
Vignette du fichier
squelette-rr.pdf (469.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00318872 , version 1 (05-09-2008)
inria-00318872 , version 2 (26-05-2009)


  • HAL Id : inria-00318872 , version 2


Nicolas Gast, Bruno Gaujal. Distributing labels on infinite trees. [Research Report] RR-6630, INRIA. 2009. ⟨inria-00318872v2⟩
149 View
101 Download


Gmail Facebook X LinkedIn More