Balanced Labeled Trees: Density, Complexity and MechanicityReport as inadecuate

Balanced Labeled Trees: Density, Complexity and Mechanicity - Download this document for free, or read online. Document in PDF available to download.

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.

Author: Nicolas Gast - Bruno Gaujal -



Related documents