• The degree of a finite set of words, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs. Leibniz Int. Proc. Inform., 182, Art. No. 54, 16, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2020, with Andrew Ryzhikov.
• Return words and bifix codes in eventually dendric sets, in Combinatorics on words, Lecture Notes in Comput. Sci., volume 11682, 167-179, Springer, Cham, 2019, with Francesco Dolce.
• Groups, languages and dendric shifts, Developments in language theory, Lecture Notes in Comput. Sci., 11088, 60--73, Springer, Cham, 2018.
• Specular sets Words 2015, 210-222, with Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy, Christophe Reutenauer and Giuseppina Rindone.
• Codes and automata in minimal sets, Combinatorics on words, Lecture Notes in Comput. Sci., 9304, 35--46, Springer, Cham, 2015,
• A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Developments in Language Theory (DLT'09). 2009. pp. 81–90. with Marie-Pierre Béal
• Embeddings of local automata. IEEE International Symposium on Information Theory (ISIT'08). 6-11 July 2008. pp. 2351–2355. with Marie-Pierre Béal, Sylvain Lombardy
• Length distributions and regular sequences, in Codes, Systems ans Graphical Models, IMA Volumes in Mathematics and its Applications, Springer-Verlag, p. 415-437, 2001. with F. Bassino et M.-P. Béal.
• Enumerative combinatorics on words , in Algebraic Combinatorics and Computer Science, Henri Crapo and Gian-Carlo Rota, Springer Verlag, 2001, 391-430,
• Symbolic dynamics and automata in MFCS 95, LNCS, 969, Springer,94-104.