On a Question of S. Eilenberg. - Christophe Reutenauer (Theor. Comput. Sci., 1977)

Sur les Series Rationnelles en Variables Non Commutatives. - Christophe Reutenauer (ICALP, 1978)

On Polya series in noncommuting variables. - Christophe Reutenauer (FCT, 1979)

Sur les variétés de langages et de monoídes. - Christophe Reutenauer (Theoretical Computer Science, 1979)

Sur les Series Associees a Certains Systemes de Lindenmayer. - Christophe Reutenauer (Theor. Comput. Sci., 1979)

Series rationnelles et algebres syntactiques. - Christophe Reutenauer (1980)

Séries formelles reconnaissables d'arbres et applications. - Jean Berstel; Christophe Reutenauer (CLAAP, 1980)

An Ogden-Like Iteration Lemma for Rational Power Series. - Christophe Reutenauer (Acta Informatica, 1980)

A New Characterization of the Regular Languages. - Christophe Reutenauer (ICALP, 1981)

Biprefix Codes and Semisimple Algebras. - Christophe Reutenauer (ICALP, 1982)

Recognizable Formal Power Series on Trees. - Jean Berstel; Christophe Reutenauer (Theor. Comput. Sci., 1982)

Some Applications of a Theorem of Shirshov to Language Theory - Antonio Restivo; Christophe Reutenauer (Inf. Control., 1983)

Cancellation, Pumping and Permutation in Formal Languages. - Antonio Restivo; Christophe Reutenauer (ICALP, 1984)

On Cancellation Properties of Languages which are Supports of Ration Power Series. - Antonio Restivo; Christophe Reutenauer (J. Comput. Syst. Sci., 1984)

On Formal Power Series Defined by Infinite Linear Systems. - Gérard Jacob; Christophe Reutenauer (Theor. Comput. Sci., 1984)

Recent results on codes. - Christophe Reutenauer (FCT, 1985)

Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene. - Christophe Reutenauer (RAIRO Theor. Informatics Appl., 1985)

The Shuffle Algebra on the Factors of a Word Is Free. - Christophe Reutenauer (J. Comb. Theory A, 1985)

Rational Languages and the Burnside Problem. - Antonio Restivo; Christophe Reutenauer (Theor. Comput. Sci., 1985)

Rational series and their languages. - Jean Berstel; Christophe Reutenauer (Springer, 1988)

Zeta Functions of Recognizable Languages. - Jean Berstel; Christophe Reutenauer (ICALP, 1988)

Subsequential Functions: Characterizations, Minimization, Examples. - Christophe Reutenauer (IMYCS, 1990)

Combinatorial Resolution of Systems of Differential Equations III: a Special Class of Differentially Algebraic Series. - François Bergeron; Christophe Reutenauer (Eur. J. Comb., 1990)

Minimization of Rational Word Functions. - Christophe Reutenauer; Marcel Paul Schützenberger (SIAM J. Comput., 1991)

Rationality of the Möbius Function of Subword Order. - Anders Björner; Christophe Reutenauer (Theor. Comput. Sci., 1992)

Computing Hall exponents in the Free Group. - Guy Melançon; Christophe Reutenauer (Int. J. Algebra Comput., 1993)

Counting Permutations with Given Cycle Structure and Descent Set. - Ira M. Gessel; Christophe Reutenauer (J. Comb. Theory A, 1993)

A Survey of Noncommutative Rational Series. - Christophe Reutenauer (Formal Power Series and Algebraic Combinatorics, 1994)

Evacuation of labelled graphs. - Claudia Malvenuto; Christophe Reutenauer (Discret. Math., 1994)

Foreword/Avant-propos. - Pierre Leroux; Christophe Reutenauer (Discret. Math., 1995)

Variétés et fonctions rationnelles. - Christophe Reutenauer; Marcel Paul Schützenberger (Theor. Comput. Sci., 1995)

Cyclic Languages and Strongly Cyclic Languages. - Marie-Pierre Béal; Olivier Carton; Christophe Reutenauer (STACS, 1996)

Plethysm and conjugation of quasi-symmetric functions. - Claudia Malvenuto; Christophe Reutenauer (Discret. Math., 1998)

On the Construction of the Free Field. - P. M. Cohn; Christophe Reutenauer (Int. J. Algebra Comput., 1999)

A Proof of Choffrut's Theorem on Subsequential Functions. - Véronique Bruyère; Christophe Reutenauer (Theor. Comput. Sci., 1999)

Inverses of Words and the Parabolic Structure of the Symmetric Group. - Christophe Hohlweg; Christophe Reutenauer (Eur. J. Comb., 2001)

On Dynkin and Klyachko Idempotents in Graded Bialgebras. - Frédéric Patras; Christophe Reutenauer (Adv. Appl. Math., 2002)

On a valuation of rational subsets of Zk Dédié à Jean Berstel - Srecko Brlek; Christophe Reutenauer (Theor. Comput. Sci., 2003)

Lyndon words, permutations and trees. - Christophe Hohlweg; Christophe Reutenauer (Theor. Comput. Sci., 2003)

On The Palindromic Complexity Of Infinite Words. - Srecko Brlek; Sylvie Hamel; Maurice Nivat; Christophe Reutenauer (Int. J. Found. Comput. Sci., 2004)

Some New Results on Palindromic Factors of Billiard Words. - Jean-Pierre Borel; Christophe Reutenauer (Developments in Language Theory, 2005)

P-Partitions and a Multi-Parameter Klyachko Idempotent. - Peter McNamara; Christophe Reutenauer (Electron. J. Comb., 2005)

Palindromic factors of billiard words. - Jean-Pierre Borel; Christophe Reutenauer (Theor. Comput. Sci., 2005)

On Christoffel classes. - Jean-Pierre Borel; Christophe Reutenauer (RAIRO Theor. Informatics Appl., 2006)

Preface. - Srecko Brlek; Christophe Reutenauer (Theor. Comput. Sci., 2007)

On a zeta function associated with automata and codes. - Sylvain Lavallée; Christophe Reutenauer (Theor. Comput. Sci., 2007)

Codes and Noncommutative Stochastic Matrices - Sylvain Lavallée; Christophe Reutenauer; Vladimir Retakh; Dominique Perrin (CoRR, 2008)

On an involution of Christoffel words and Sturmian morphisms. - Valérie Berthé; Aldo de Luca; Christophe Reutenauer (Eur. J. Comb., 2008)

Michel Fliess and non-commutative formal power series. - Christophe Reutenauer (Int. J. Control, 2008)

Another proof of Soittola's theorem. - Jean Berstel; Christophe Reutenauer (Theor. Comput. Sci., 2008)

Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. - Jean Berstel; Christophe Reutenauer (Theor. Comput. Sci., 2008)

A palindromization map for the free group. - Christian Kassel; Christophe Reutenauer (Theor. Comput. Sci., 2008)

Lyndon + Christoffel = digitally convex. - Srecko Brlek; Jacques-Olivier Lachaud; Xavier Provençal; Christophe Reutenauer (Pattern Recognit., 2009)

A Sturmian sequence related to the uniqueness conjecture for Markoff numbers. - Yann Bugeaud; Christophe Reutenauer; Samir Siksek (Theor. Comput. Sci., 2009)

Codes and Automata. - Jean Berstel; Dominique Perrin; Christophe Reutenauer (Cambridge University Press, 2010)

Bifix codes and Sturmian words - Jean Berstel; Clelia de Felice; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (CoRR, 2010)

Christoffel Words and the Calkin-Wilf Tree. - Alessandro De Luca 002; Christophe Reutenauer (Electron. J. Comb., 2011)

Generalized descent patterns in permutations and associated Hopf algebras. - Jean-Christophe Novelli; Christophe Reutenauer; Jean-Yves Thibon (Eur. J. Comb., 2011)

A self paired Hopf algebra on double posets and a Littlewood-Richardson rule. - Claudia Malvenuto; Christophe Reutenauer (J. Comb. Theory A, 2011)

Complexity and palindromic defect of infinite words. - Srecko Brlek; Christophe Reutenauer (Theor. Comput. Sci., 2011)

On the superimposition of Christoffel words. - Geneviève Paquin; Christophe Reutenauer (Theor. Comput. Sci., 2011)

On a Matrix Representation for Polynomially Recursive Sequences. - Christophe Reutenauer (Electron. J. Comb., 2012)

Recent results on syntactic groups of prefix codes. - Jean Berstel; Clelia de Felice; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (Eur. J. Comb., 2012)

A bijection between words and multisets of necklaces. - Ira M. Gessel; Antonio Restivo; Christophe Reutenauer (Eur. J. Comb., 2012)

Bifix codes in acyclic sets. - Valérie Berthé; Clelia de Felice; Francesco Dolce; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (CoRR, 2013)

Return words in interval exchange transformations - Valérie Berthé; Clelia de Felice; Francesco Dolce; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (CoRR, 2013)

Bifix codes and the finite index basis property - Valérie Berthé; Clelia de Felice; Francesco Dolce; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (CoRR, 2013)

Generation of Combinatorial Structures. - Srecko Brlek; Christophe Reutenauer; Jean-Guy Penaud (Theor. Comput. Sci., 2013)

A d-dimensional Extension of Christoffel Words. - Sébastien Labbé 001; Christophe Reutenauer (Discret. Comput. Geom., 2015)

Maximal bifix decoding. - Valérie Berthé; Clelia de Felice; Francesco Dolce; Julien Leroy 002; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (Discret. Math., 2015)

Studies on finite Sturmian words. - Christophe Reutenauer (Theor. Comput. Sci., 2015)

Recurrent and birecurrent sets. - Francesco Dolce; Dominique Perrin; Antonio Restivo; Christophe Reutenauer; Giuseppina Rindone (CoRR, 2017)

Specular sets. - Valérie Berthé; Clelia De Felice; Vincent Delecroix; Francesco Dolce; Julien Leroy 002; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (Theor. Comput. Sci., 2017)

On Sillke's bijection. - Robert Cori; Christophe Reutenauer (Theor. Comput. Sci., 2017)

Hall sets, Lazard sets and comma-free codes. - Dominique Perrin; Christophe Reutenauer (Discret. Math., 2018)

Birecurrent sets. - Francesco Dolce; Dominique Perrin; Antonio Restivo; Christophe Reutenauer; Giuseppina Rindone (Int. J. Algebra Comput., 2018)

Preface. - Alexandre Blondin Massé; Srecko Brlek; Christophe Reutenauer (Int. J. Found. Comput. Sci., 2018)

Some Variations on Lyndon Words (Invited Talk). - Francesco Dolce; Antonio Restivo; Christophe Reutenauer (CPM, 2019)

A Mahler's Theorem for Word Functions. - Jean-Éric Pin; Christophe Reutenauer (ICALP, 2019)

Some variations on Lyndon words. - Francesco Dolce; Antonio Restivo; Christophe Reutenauer (CoRR, 2019)

Quasi-automatic semigroups. - Benjamin Blanchette; Christian Choffrut; Christophe Reutenauer (Theor. Comput. Sci., 2019)

On generalized Lyndon words. - Francesco Dolce; Antonio Restivo; Christophe Reutenauer (Theor. Comput. Sci., 2019)

Palindromization and construction of Markoff triples. - Antoine Abram; Mélodie Lapointe; Christophe Reutenauer (Theor. Comput. Sci., 2020)

Reprint of: Palindromization and construction of Markoff triples. - Antoine Abram; Mélodie Lapointe; Christophe Reutenauer (Theor. Comput. Sci., 2020)

Christoffel words and weak Markoff theory. - Christophe Reutenauer (Adv. Appl. Math., 2021)

An Order on Circular Permutations. - Antoine Abram; Nathan Chapelier-Laget; Christophe Reutenauer (Electron. J. Comb., 2021)

Graded alphabets, circular codes, free Lie algebras and comma-free codes. - Dominique Perrin; Christophe Reutenauer (Discret. Math., 2021)

Primitive elements of the Hopf algebras of tableaux. - Claudia Malvenuto; Christophe Reutenauer (Eur. J. Comb., 2021)

The palindromization map. - Dominique Perrin; Christophe Reutenauer (Discret. Appl. Math., 2023)

A Symmetry Property of Christoffel Words. - Yan Lanciault; Christophe Reutenauer (GASCom, 2024)

Christoffel Matrices and Sturmian Determinants. - Christophe Reutenauer; Jeffrey O. Shallit (CoRR, 2024)

Characterizations of Perfectly Clustering Words. - Mélodie Lapointe; Christophe Reutenauer (Electron. J. Comb., 2025)

A generalization of perfectly clustering words and band bricks for certain gentle algebras. - Benjamin Dequêne; Mélodie Lapointe; Yann Palu; Pierre-Guy Plamondon; Christophe Reutenauer; Hugh Thomas (Comb. Theory, 2025)