Books

• Codes and automata Cambridge University Press, 2010, with Jean Berstel and Christophe Reutenauer
• Applied Combinatorics on Words (M. Lothaire), Cambridge University Press, 2005.
• Infinite Words, automata, semigroups, logic and games with Jean-Eric Pin, Elsevier, 2004.
• Algebraic Combinatorics on Words (M. Lothaire),Cambridge University Press, 2002.
• Theory of Codes, Academic Press, 1985, with Jean Berstel.
• Combinatorics on Words , (M. Lothaire), Cambridge University Press, 1983 , second edition, 1997.

Book chapters

• Symbolic dynamics, with Marie-Pierre Béal, Jean Berstel and Soren Eilers, to appear in Handbook of Automata, Jean-Eric Pin ed. European Mathematical Society.
• Variable-length codes and automata, with Marie-Pierre Béal, Jean Berstel, Brian Marcus and Paul Siegel, in Selected Topics in Information and Coding Theory, I. Woungang and S. Misra eds. World Scientific, 2010.
• Automata and semigroups recognizing infinite words, with Olivier Carton and Jean-Eric Pin, in Logic and Automata, History and Perspectives, Jorg Flum, Erich Gradel and Thomas Wilke eds., Amsterdam University Press, 2008.
• Symbolic Dynamics and Finite Automata, in Handbook of Formal Languages, G. Rosenberg and A. Salomaa Eds., chapter 10, vol. 2, Springer, 1997. version corrigée de décembre 1999 (avec M.-P. Béal).
• Finite automata, in Handbook of Theoretical Computer Science, vol. B, Formal Models and Semantics, Jan van Leuwen editor, Elsevier, 1990, pages 1-57. Erratum for Section 8 in M. Rigo, L. Waxweiler, A note on syndeticity, recognizable sets and Cobham's theorem, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 88 (2006), 169--173.

Articles

• A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata, with Marie-Pierre Béal and Mikhail V. Berlinkov, Int. J. Found. Comput. Sci. 22(2): 277-288 (2011)
• Recent results on syntactic groups of codes European J. Combin.,, to appear, with Jean Berstel, Clelia De Felice and Christophe Reutenauer.
• Embeddings of local automata. Illinois Journal of Mathematics, 54, 2010. pp. 155-174. with Marie-Pierre Béal and Sylvain Lombardy.
• Bifix codes and Sturmian words with Jean Berstel, Clelia De Felice, Christophe Reutenauer and Giuseppina Rindone.
• On the groups of codes with empty kernel Semigroup Forum 80, Issue 3 (2010), 351. with Jean Berstel, Clelia De Felice and Giuseppina Rindone.
• Codes and noncommutative stochastic matrices Journal of Noncommutative Geometry, 4, 2010, 531--554 (with Sylvain Lavallée and Christophe Reutenauer).
• Completing codes in a sofic shift, Theoret. Comput. Sci., 410, 4423-4431, 2009, with Marie-Pierre Béal.
• Gérard Lallement (1935-2006), Semigroup Forum, 3, 379-383, 2009, with J. Almeida.
• Automata and semigroups recognizing infinite words, in Logic and automata, Amsterdam Univ. Press, 133-167, 2008, with J.-E. Pin and O. Carton.
• Unambiguous automata, Math. Comput. Sci., 4, 625-638, 2008, with Marie-Pierre Béal, Eugen Czeizler and Jarkko Kari,
• The origins of combinatorics on words, European J. Combin., 28, with Jean Berstel. 996-1022, 2007
• The syntactic graph of a sophic shift is invariant under shift equivalence, Int. J. Alg. Comput.,16, 2006, 443-460, with Marie-Pierre Béal and Francesca Fiorenzi.
• Codes, unambiguous automata and sofic systems, Theoret. Comput. Sci., 356, 6-13, 2006, with Marie-Pierre Béal.
• A note on the Burrows-Wheeler transformation, Theoret. Comput. Sci., 332, 567-572, 2005, with Jacques Désarménien and Maxime Crochemore.
• Unavoidable sets of constant length , Int. J. Alg. Comput., 14, 2004, with Jean-Marc Champarnaud and Georges Hansel.
• Automata and formal languages , english version of Automai e linguaggi formali, in Storia della scienza, Istituto della Enciclopedia Italiana, IX, 2003, 197-205.
• On the generating sequences of regular languages on $k$ symbols J. Assoc. Comput. Mach., 50, 2003, 121-135, with Marie-Pierre Béal.
• Syntactic Groups , Bulletin of the Belgium Mathematical society, 10, 2003, 749-759, with Giuseppina Rindone.
• Ensembles inévitables, Séminaire Lotharingien de Combinatoire, 2002, vol. 47. with Guoniu Han.
• Automates finis, Technique et Science Informatique, 2000, 19, 395-402,
• A finite-state version of the Kraft-McMillan theorem, SIAM J. Comput., 30,1211-1230, 2000 with Frédérique Bassino and Marie-Pierre Béal erratum
• Chains and superchains for w-rational sets, automata and semigroups, Int. J. Algebra Comput., 7, 1997, 673-696 with Olivier Carton.
• The Wagner hierarchy of ω-rational sets, Int. J. Alg. Comput., vol. 9, no. 5, pp. 597-620, 1999. with O. Carton.

Proceedings

• 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.