B. Adamczewski 2003 Balances for fixed points of primitive substitutions Theoret. Comput. Sci. 307 1 47–75 http://dx.doi.org/10.1016/S0304-3975(03)00092-6 Words E. Andres 2003 Discrete linear objects in dimension n: the standard model Graphical Models 65 92–111 P. Arnoux V. Berthé 2002 Some open problems Substitutions in dynamics, arithmetics and combinatorics Lecture Notes in Math. 1794 Springer
Berlin
363–374 P. Arnoux C. Mauduit I. Shiokawa J. i. Tamura 1994 Complexity of sequences defined by billiard in the cube Bull. Soc. Math. France 122 1 1–12 http://www.numdam.org/item?id=BSMF_1994__122_1_1_0 P. Arnoux G. Rauzy 1991 Représentation géométrique de suites de complexité 2n+1 Bull. Soc. Math. France 119 2 199–215 Yu. Baryshnikov 1995 Complexity of trajectories in rectangular billiards Comm. Math. Phys. 174 1 43–56 http://projecteuclid.org/getRecord?id=euclid.cmp/1104275093 V. Berthé S. Labbé 2011 An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines I. Debled-Rennesson E. Domenjoud B. Kerautret P. Even DGCI Lecture Notes in Computer Science 6607 Springer 47–58 http://dx.doi.org/10.1007/978-3-642-19867-0_4 V. Berthé A. Siegel 2005 Tilings associated with beta-numeration and substitutions Integers 5 3 A2, 46 V. E. Brimkov R. P. Barneva B. Brimkov 2009 Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD. S. Brlek C. Reutenauer X. Provençal DGCI Lecture Notes in Computer Science 5810 Springer 337–349 http://dx.doi.org/10.1007/978-3-642-04397-0_29 J. Cassaigne S. Ferenczi A. Messaoudi 2008 Weak mixing and eigenvalues for Arnoux-Rauzy sequences Ann. Inst. Fourier (Grenoble) 58 6 1983–2005 http://aif.cedram.org/item?id=AIF_2008__58_6_1983_0 J. Cassaigne S. Ferenczi L. Q. Zamboni 2000 Imbalances in Arnoux-Rauzy sequences Ann. Inst. Fourier (Grenoble) 50 4 1265–1276 http://www.numdam.org/item?id=AIF_2000__50_4_1265_0 N. Chevallier 2009 Coding of a translation of the two-dimensional torus Monatsh. Math. 157 2 101–130 http://dx.doi.org/10.1007/s00605-008-0074-y F. Durand 2003 Corrigendum and addendum to: ``Linearly recurrent subshifts have a finite number of non-periodic subshift factors'' [Ergodic Theory Dynam. Systems 20 (2000) 1061–1078] Ergodic Theory Dynam. Systems 23 2 663–669 http://dx.doi.org/10.1017/S0143385702001293 O. Figueiredo J.-P. Reveillès 1996 New results about 3D digital lines Proc. Internat. Conference Vision Geometry V , Proc. SPIE, 2826 98–108 R. Fischer F. Schweiger 1975 The number of steps in a finite Jacobi algorithm Manuscripta Math. 17 3 291–308 A. S. Fraenkel 1973 Complementing and exactly covering sequences J. Combinatorial Theory Ser. A 14 8–20 R. L. Graham 1973 Covering the positive integers by disjoint sets of the form {[nα+β]: n=1,+.1667em2,+.1667em} J. Combinatorial Theory Ser. A 15 354–358 P. Hubert 2000 Suites équilibrées Theoret. Comput. Sci. 242 1-2 91–108 http://dx.doi.org/10.1016/S0304-3975(98)00202-3 R. Morikawa 1982/83 On eventually covering families generated by the bracket function Bull. Fac. Liberal Arts Nagasaki Univ. 23 1 17–22 F. Schweiger 2000 Multidimensinal Continued Fraction Oxford Univ. Press
New York
 W.+.1667emA. Stein 2011 Sage Mathematics Software (Version 4.7) The Sage Development Team http://www.sagemath.org R. Tijdeman 1980 The chairman assignment problem Discrete Math. 32 3 323–330 http://dx.doi.org/10.1016/0012-365X(80)90269-1 J.-L. Toutant 2006 Characterization of the Closest Discrete Approximation of a Line in the 3-Dimensional Space ISVC (1) Lecture Notes in Computer Science 4291 Springer 618–627 http://dx.doi.org/10.1007/11919476_62 L. Vuillon 2003 Balanced words Bull. Belg. Math. Soc. Simon Stevin 10 suppl. 787–805 http://projecteuclid.org/getRecord?id=euclid.bbms/1074791332 N. Wozny L. Q. Zamboni 2001 Frequencies of factors in Arnoux-Rauzy sequences Acta Arith. 96 3 261–278 http://dx.doi.org/10.4064/aa96-3-6