Liste des citations dans Numdam pour : Complexity of infinite words associated with beta-expansions

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004), p. 163-185 / 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

Turek, Ondřej

Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007), p. 123-135 / 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

Ambrož, Petr ; Masáková, Zuzana ; Pelantová, Edita ; Frougny, Christiane

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

Frougny, Christiane ; Masáková, Zuzana ; Pelantová, Edita

Corrigendum : “Complexity of infinite words associated with beta-expansions”
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004), p. 269-271 / Harvested from Numdam