Berstel, J.: Sturmian and episturmian words. In: Bozapalidis, S., Rahonis, G. (eds.) Algebraic Informatics. Lecture Notes in Computer Science, vol. 4728, pp. 23–47. Springer, Berlin (2007). doi:10.1007/978-3-540-75414-5_2
Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetition in Words. CRM Monograph Series, vol. 27. American Mathematical Society, Providence, RI (2008)
Berthé, V., Tijdeman, R.: Lattices and multi-dimensional words. Theor. Comput. Sci. 319(1–3), 177–202 (2004). doi:10.1016/j.tcs.2004.02.016
Berthé, V., Vuillon, L.: Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences. Discrete Math. 223(1–3), 27–53 (2000). doi:10.1016/S0012-365X(00)00039-X
Bodini, O., Fernique, T., Rémila, É.: A characterization of flip-accessibility for rhombus tilings of the whole plane. Inf. Comput. 206(9–10), 1065–1073 (2008). doi:10.1016/j.ic.2008.03.008
Bodini, O., Fernique, T., Rao, M., Rémila, É.: Distances on rhombus tilings. Theor. Comput. Sci. 412(36), 4787–4794 (2011). doi:10.1016/j.tcs.2011.04.015
Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity—a review. Discrete Appl. Math. 155(4), 468–495 (2007). doi:10.1016/j.dam.2006.08.004
Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Int. J. Found. Comput. Sci. 15(2), 293–306 (2004)
Carpi, A., Luca, A.: Central Sturmian words: recent developments. In: Felice, C., Restivo, A. (eds.) Developments in Language Theory. Lecture Notes in Computer Science, vol. 3572, pp. 36–56. Springer, Berlin (2005). doi:10.1007/11505877_4
Chuan, W.F.: $$\alpha $$α-Words and factors of characteristic sequences. Discrete Math. 177(1–3), 33–50 (1997). doi:10.1016/S0012-365X(96)00355-X
Debled-Rennesson, I.: Reconnaissance des droites et plans discrets. Université Louis Pasteur - Strasbourg, Thèse de Doctorat (1995)
Domenjoud, E., Vuillon, L.: Geometric palindromic closure. Unif. Distrib. Theory 7(2), 109–140 (2012)
Fernique, T.: Pavages, fractions continues et géométrie discrète. Thèse de Doctorat, Université Montpellier 2 (2007). http://tel.archives-ouvertes.fr/tel-00206966
Françon, J.: Sur la topologie d’un plan arithmétique. Theor. Comput. Sci. 156(1–2), 159–176 (1996). doi:10.1016/0304-3975(95)00059-3
Françon, J., Schramm, M., Tajine, M.: Recognizing arithmetic straight lines and planes. Discrete Geometry for Computer Imagery (Lyon, 1996). Lecture Notes in Computer Science, vol. 1176, pp. 141–150. Springer, Berlin (1996)
Ito, S., Ohtsuki, M.: Modified Jacobi–Perron algorithm and generating Markov partitions for special hyperbolic toral automorphisms. Tokyo J. Math. 16(2), 441–472 (1993). doi:10.3836/tjm/1270128497
Ito, S., Ohtsuki, M.: Parallelogram tilings and Jacobi–Perron algorithm. Tokyo J. Math. 17(1), 33–58 (1994). doi:10.3836/tjm/1270128186
Pirillo, G.: A curious characteristic property of standard Sturmian words. Algebraic Combinatorics and Computer Science, pp. 541–546. Springer, Milan (2001)
Provot, L., Buzer, L., Debled-Rennesson, I.: Recognition of blurred pieces of discrete planes. In: Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, vol. 4245, pp. 65–76. Springer, Berlin (2006). doi:10.1007/11907350_6
Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse de Doctorat, Université Louis Pasteur, Strasbourg (1991)
Reveillès, J.P.: Combinatorial pieces in digital lines and planes. In: Vision Geometry, IV (San Diego, CA, 1995). Proceedings of SPIE, vol. 2573, pp. 23–34. SPIE, Bellingham (1995). doi:10.1117/12.216425
Vuillon, L.: Local configurations in a discrete plane. Bull. Belg. Math. Soc. Simon Stevin 6(4), 625–636 (1999)
