Double sequences with complexity mn+11
Automatica (Journal of IFAC)
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
On The Optimal Open-Loop Control Policy For Deterministic And Exponential Polling Systems
Probability in the Engineering and Informational Sciences
Theory of Computing Systems - Special Issue: Theoretical Aspects of Computer Science; Guest Editors: Wolgang Thomas and Pascal Weil
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
| Hi-index | 5.23 |
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.