Download

Full Text

• Adamczewski, B., Balances for fixed points of primitive substitutions (2003) Theoret. Comput. Sci., 307, pp. 47-75
• Andres, E., Discrete linear objects in dimension n: The standard model (2003) Graph. Models, 65, pp. 92-111
• Arnoux, P., Rauzy, G., Représentation géométrique de suites de complexité 2 n + 1 (1991) Bull. Soc. Math. France, 119, pp. 199-215
• Baryshnikov, Y., Complexity of trajectories in rectangular billiards (1995) Comm. Math. Phys., 174, pp. 43-56
• Bedaride, N., Billiard complexity in rational polyhedra (2003) Regul. Chaotic Dyn., 8, pp. 97-104
• Berthé, V., Delecroix, V., Beyond substitutive dynamical systems: S-adic expansions (2014) RIMS Lecture Note 'Kokyuroku Bessatu', B46, pp. 81-123
• Berthé, V., Labbé, S., Uniformly balanced words with linear complexity and prescribed letter frequencies (2011) WORDS Electronic Proc. Theoret. Comput. Sci., 63, pp. 44-52. , Open Publishing Association
• Berthé, V., Labbé, S., Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm (2013) WORDS, 8079, pp. 71-82. , Lecture Notes in Comput. Sci. Springer
• Boshernitzan, M., A unique ergodicity of minimal symbolic flows with linear block growth (1984) J. Anal. Math., 44, pp. 77-96
• Brentjes, A.J., (1981) Multidimensional Continued Fraction Algorithms, , Mathematisch Centrum Amsterdam
• Cassaigne, J., Complexité et facteurs spéciaux (1997) Bull. Belg. Math. Soc. Simon Stevin, 4, pp. 67-88
• Cassaigne, J., Sequences with grouped factors (1997) Developments in Language Theory, pp. 211-222. , Aristotle University of Thessaloniki
• Cassaigne, J., Nicolas, F., Factor complexity (2010) Combinatorics, Automata and Number Theory, 135, pp. 163-247. , Encyclopedia Math. Appl. Cambridge Univ. Press Cambridge
• Coven, E.M., Sequences with minimal block growth, ii (1975) Math. Syst. Theory, 8, pp. 376-382
• Delecroix, V., Hejda, T., Steiner, W., Balancedness of Arnoux-Rauzy and Brun words (2013) WORDS, 8079, pp. 119-131. , Lecture Notes in Comput. Sci. Springer
• Durand, F., Linearly recurrent subshifts have a finite number of non-periodic subshift factors (2000) Ergodic Theory Dynam. Systems, 20, pp. 1061-1078
• Durand, F., (2003) Ergodic Theory Dynam. Systems, 23, pp. 663-669. , (Corrigendum and addendum)
• Durand, F., Leroy, J., Richomme, G., Do the properties of an S-adic representation determine factor complexity? (2013) J. Integer Seq., 16. , Article 13.2.6
• Ferenczi, S., Rank and symbolic complexity (1996) Ergodic Theory Dynam. Systems, 16, pp. 663-682
• Ferenczi, S., Monteil, T., Infinite words with uniform frequencies, and invariant measures (2010) Combinatorics, Automata and Number Theory, 135, pp. 373-409. , Encyclopedia Math. Appl. Cambridge Univ. Press
• Fogg, N.P., Substitutions in dynamics, arithmetics and combinatorics (2002) Lecture Notes in Math., 1794. , V. Berthé, S. Ferenczi, C. Mauduit, A. Siegel, Springer-Verlag Berlin
• Klouda, K., Bispecial factors in circular non-pushy D0L languages (2012) Theoret. Comput. Sci., 445, pp. 63-74
• Labbé, S., (2012) Structure des Pavages, Droites Discrètes 3D et Combinatoire des Mots, , Thèse Université du Québec à Montréal
• Leroy, J., Some improvements of the S-adic conjecture (2012) Adv. in Appl. Math., 48, pp. 79-98
• Lothaire, M., (2002) Algebraic Combinatorics on Words, , Cambridge University Press Cambridge
• Nogueira, A., The three-dimensional Poincaré continued fraction algorithm (1995) Israel J. Math., 90, pp. 373-401
• Paul, M.E., Minimal symbolic flows having minimal block growth (1975) Math. Systems Theory, 8, pp. 309-315
• Schweiger, F., (2000) Multidimensional Continued Fractions, , Oxford University Press Oxford
• Zorich, A., Deviation for interval exchange transformations (1997) Ergodic Theory Dynam. Systems, 17, pp. 1477-1499