Balanced Labeled Trees: Density, Complexity and Mechanicity

Nicolas Gast 1 Bruno Gaujal 1
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Sturmian words are very particular infinite words with many equivalent definitions: minimal complexity of aperiodic sequences, balanced sequences and mechanical words. One natural way to generalize the first definition to trees is to consider planar trees of complexity n+1 but in doing so, one looses the other two properties. In this paper we will study non-planar trees. In this case, we show that strongly balanced trees are exactly mechanical trees. Moreover we will see that they are also aperiodic trees of minimal complexity, so that the three equivalent definitions of Sturmian words are almost preserved for non planar trees.
Document type :
Liste complète des métadonnées
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, July 4, 2007 - 2:31:49 PM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM
Document(s) archivé(s) le : Tuesday, September 21, 2010 - 1:37:47 PM


Files produced by the author(s)


  • HAL Id : inria-00159564, version 2



Nicolas Gast, Bruno Gaujal. Balanced Labeled Trees: Density, Complexity and Mechanicity. [Research Report] RR-6240, INRIA. 2007, pp.25. ⟨inria-00159564v2⟩



Record views


Files downloads