Distributing labels on infinite trees

[10] B. Gaujal, A. Hordijk, and D. Van der Laan. On the optimal open-loop control policy fordeterministic and exponential polling systems. Probability in Engineering and InformationalSciences, 21:157–187, 2007.[11] B. Gaujal and E. Hyon. Optimal routing policy in two deterministic queues. CalculateursParallèles, 2001.[12] B. Hajek. Extremal splittings of point processes. Mathematics of Operation Research,10(4):543–556, 1985.[13] R. Klette and A. Rosenfeld. Digital straightness- a review. Discrete Appl. Math., 139:197–230, 2004.[14] M. Lothaire. Algebraic combinatorics on words. Cambridge University Press New York,2002.[15] E. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time.Journal of Computer and System Sciences, 25:42–65, 1982.[16] M. Morse and G.A. Hedlund. Symbolic dynamics ii. sturmian trajectories. Amer. J. Math.,62:1–42, 1940.[17] N.J.A. Sloane et al. The On-Line Encyclopedia of Integer Sequences, 2003.30