Infinite labeled trees: From rational to Sturmian trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2010

Infinite labeled trees: From rational to Sturmian trees

Nicolas Gast
Bruno Gaujal

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.
Fichier principal
Vignette du fichier
tcs-GastGaujal.pdf (455.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01086034 , version 1 (21-11-2014)

Identifiers

Cite

Nicolas Gast, Bruno Gaujal. Infinite labeled trees: From rational to Sturmian trees. Theoretical Computer Science, 2010, 411, pp.1146 - 1166. ⟨10.1016/j.tcs.2009.12.009⟩. ⟨hal-01086034⟩
336 View
136 Download

Altmetric

Share

Gmail Facebook X LinkedIn More