Liste des citations dans Numdam pour : Comparing complexity functions of a language and its extendable part

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008), p. 647-655 / Harvested from Numdam

Mercaş, Robert ; Ochem, Pascal ; Samsonov, Alexey V. ; Shur, Arseny M.

Binary patterns in binary cube-free words: Avoidability and growth
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014), p. 369-389 / Harvested from Numdam

Samsonov, Alexey V. ; Shur, Arseny M.

On abelian repetition threshold
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012), p. 147-163 / Harvested from Numdam

Shur, Arseny M. ; Gorbunova, Irina A.

On the growth rates of complexity of threshold languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 44 (2010), p. 175-192 / Harvested from Numdam