D. Beauquier and M. Nivat, On translating one polyomino to tile the plane, Discrete & Computational Geometry, vol.62, issue.4, pp.575-592, 1991.
DOI : 10.1007/BF02574705

J. Berstel, A. Lauve, C. Reutenauer, and F. Saliola, Combinatorics on Words: Christoffel Words and Repetition in Words, volume 27 of CRM monograph series, 2008.

A. Blondin-massé, S. Brlek, A. Garon, and S. Labbé, Christoffel and Fibonacci Tiles, DGCI 2009, 15th IAPR Int. Conf. on Discrete Geometry for Computer Imagery, number 5810 in LNCS, pp.67-78, 2009.
DOI : 10.1007/978-1-4613-8476-2

A. Blondin-massé, S. Brlek, A. Garon, and S. Labbé, Every polyomino yields at most two square tilings, 7th Int. Conf. on Lattice Paths Combinatorics and Applications, 2010.

A. Blondin-massé, S. Brlek, S. Labbé, and M. M. France, Fibonacci snowflakes, Annales des Sciences Mathématiques du Québec, 2010.

S. Brlek and X. Provençal, An Optimal Algorithm for Detecting Pseudo-squares, DGCI 2006, 13th Int. Conf. on Discrete Geometry for Computer Imagery, number 4245 in LNCS, pp.403-412, 2006.
DOI : 10.1007/11907350_34
URL : https://hal.archives-ouvertes.fr/hal-00395242

S. Brlek, A. Frosini, S. Rinaldi, and L. Vuillon, Tilings by translation: Enumeration by a rational language approach, Electr. J. Comb, vol.13, issue.1, 2006.

S. Brlek, G. Labelle, and A. Lacasse, PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS, International Journal of Foundations of Computer Science, vol.17, issue.03, pp.543-556, 2006.
DOI : 10.1142/S012905410600398X

S. Brlek, M. Koskas, and X. Provençal, A Linear Time and Space Algorithm for Detecting Path Intersection, DGCI 2009, 15th IAPR Int. Conf. on Discrete Geometry for Computer Imagery, number 5810 in LNCS, pp.398-409, 2009.
DOI : 10.1017/CBO9781107341005
URL : https://hal.archives-ouvertes.fr/lirmm-00432381

S. Brlek, X. Provençal, and J. Fédou, On the tiling by translation problem, Discrete Applied Mathematics, vol.157, issue.3, pp.464-475, 2009.
DOI : 10.1016/j.dam.2008.05.026
URL : https://hal.archives-ouvertes.fr/hal-00395229

I. Gambini and L. Vuillon, An algorithm for deciding if a polyomino tiles the plane, RAIRO - Theoretical Informatics and Applications, vol.41, issue.2, pp.147-155, 2007.
DOI : 10.1051/ita:2007012
URL : https://hal.archives-ouvertes.fr/hal-00377638

B. Grünbaum and G. C. Shephard, Tilings and Patterns, 1987.

M. Lothaire, Combinatorics on Words, 1997.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. Lothaire, Applied Combinatorics on Words, 2005.
DOI : 10.1017/CBO9781107341005
URL : https://hal.archives-ouvertes.fr/hal-00620607

A. Monnerot-dumaine, The Fibonacci word fractal Preprint available electronically at http, 2009.

P. Prusinkiewicz and A. Lindenmayer, The algorithmic beauty of plants, 1990.
DOI : 10.1007/978-1-4613-8476-2

G. Rozenberg and A. Salomaa, Mathematical theory of L-systems, 1980.

H. A. Wijshoff and J. Van-leeuven, Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino, Information and Control, vol.62, issue.1, pp.1-25, 1984.
DOI : 10.1016/S0019-9958(84)80007-8