A. V. Aho and N. J. Sloane, Some doubly exponential sequences, Fibonacci Quarterly, vol.11, issue.4, pp.429-437, 1973.

E. Altman, B. Gaujal, and A. Hordijk, Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity. Number 1829 in LNM, 2003.

J. Berstel, Sturmian and Episturmian Words, Conference on Algebraic Informatics, pp.23-47, 2007.
DOI : 10.1007/978-3-540-75414-5_2
URL : https://hal.archives-ouvertes.fr/hal-00620128

J. Berstel, L. Boasson, and O. , A First Investigation of Sturmian Trees, LECTURE NOTES IN COMPUTER SCIENCE, vol.4393, p.73, 2007.
DOI : 10.1007/978-3-540-70918-3_7
URL : https://hal.archives-ouvertes.fr/hal-00150178

J. Berstel and M. Pocchiola, Random generation of finite Sturmian words, LIENS -93 -8, 1993.
DOI : 10.1016/0012-365X(95)00125-G
URL : https://hal.archives-ouvertes.fr/hal-00619489

E. Borel, Les probabilit??s d??nombrables et leurs applications arithm??tiques, Rendiconti del Circolo Matematico di Palermo, vol.XXXIII, issue.1, pp.247-271, 1909.
DOI : 10.1007/BF03019651

J. Cassaigne, Double sequences with complexity mn+1, J. Autom. Lang. Comb, vol.4, issue.3, pp.153-170, 1999.

B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science, vol.25, issue.2, pp.95-169, 1983.
DOI : 10.1016/0304-3975(83)90059-2

R. Durrett, Probability: theory and examples, 1991.
DOI : 10.1017/CBO9780511779398

T. Fernique, Pavages, Fractions continues et géométrie discrète, 2007.

N. Gast and B. Gaujal, Balanced labeled trees: density, complexity and mechanicity, Words, 6th international conference on words, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00159564

B. Gaujal, A. Hordijk, and D. Van-der-laan, ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS, Probability in Engineering and Informational Sciences, pp.157-187, 2007.
DOI : 10.1214/aoap/1177004701

B. Gaujal and E. Hyon, Optimal routing policy in two deterministic queues. CalculateursParalì eles, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100925

B. Hajek, Extremal Splittings of Point Processes, Mathematics of Operations Research, vol.10, issue.4, pp.543-556, 1985.
DOI : 10.1287/moor.10.4.543

R. Klette and A. Rosenfeld, Digital straightness???a review, Discrete Applied Mathematics, vol.139, issue.1-3, pp.197-230, 2004.
DOI : 10.1016/j.dam.2002.12.001

M. Lothaire, Algebraic combinatorics on words, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

E. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences, vol.25, issue.1, pp.42-65, 1982.
DOI : 10.1016/0022-0000(82)90009-5

M. Morse and G. A. Hedlund, Symbolic Dynamics II. Sturmian Trajectories, American Journal of Mathematics, vol.62, issue.1/4, pp.1-42, 1940.
DOI : 10.2307/2371431

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences INRIA Centre de recherche INRIA Grenoble ? Rhône-Alpes 655, 2003.