Distributing labels on infinite trees

Nicolas Gast 1, * Bruno Gaujal 1
* Corresponding author
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00318872
Contributor : Bruno Gaujal <>
Submitted on : Tuesday, May 26, 2009 - 10:32:37 AM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM
Long-term archiving on : Saturday, November 26, 2016 - 9:18:57 AM

File

squelette-rr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00318872, version 2

Collections

Citation

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

Share

Metrics

Record views

345

Files downloads

147