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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-00788906
Contributor : Arnaud Legrand <>
Submitted on : Friday, February 15, 2013 - 1:46:07 PM
Last modification on : Saturday, April 13, 2019 - 1:31:33 AM

Links full text

Identifiers

Collections

INRIA | UGA | LIG

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⟩

Share

Metrics

Record views

222