Infinite Labeled Trees: from Rational to Sturmian Trees

Nicolas Gast 1 Bruno Gaujal 1
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This paper studies infinite unordered d-ary trees with nodes labeled by 0, 1. We introduce the notions of rational and Sturmian trees along with the definitions of (strongly) balanced trees and mechanical trees, and study the relations among them. In particular, we show that (strongly) balanced trees exist and coincide with mechanical trees in the irrational case, providing an effective construction. Such trees also have a minimal factor complexity, hence are Sturmian. We also give several examples illustrating the inclusion relations between these classes of trees.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2009, 411, pp.1146-1166. 〈10.1016/j.tcs.2009.12.009〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00788906
Contributeur : Arnaud Legrand <>
Soumis le : vendredi 15 février 2013 - 13:46:07
Dernière modification le : jeudi 11 janvier 2018 - 06:21:39

Identifiants

Collections

Citation

Nicolas Gast, Bruno Gaujal. Infinite Labeled Trees: from Rational to Sturmian Trees. Theoretical Computer Science, Elsevier, 2009, 411, pp.1146-1166. 〈10.1016/j.tcs.2009.12.009〉. 〈hal-00788906〉

Partager

Métriques

Consultations de la notice

151