Liste des citations dans Numdam pour : Palindromic complexity of infinite words associated with simple Parry numbers
[Complexité palindromique des mots infinis associés aux nombres de Parry simples]

Annales de l'Institut Fourier, Tome 56 (2006), p. 2131-2160 / Harvested from Numdam

Balková, L'ubomíra ; Pelantová, Edita ; Starosta, Štěpán

Sturmian jungle (or garden?) on multiliteral alphabets
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 44 (2010), p. 443-470 / Harvested from Numdam

Balková, L'ubomíra ; Masáková, Zuzana

Palindromic complexity of infinite words associated with non-simple Parry numbers
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009), p. 145-163 / Harvested from Numdam

Glen, Amy ; Justin, Jacques

Episturmian words : a survey
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009), p. 403-442 / Harvested from Numdam

Bernat, Julien

Study of irreducible balanced pairs for substitutive languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008), p. 663-678 / Harvested from Numdam

Balková, Lubomíra ; Pelantová, Edita ; Turek, Ondřej

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007), p. 307-328 / Harvested from Numdam