Christophe Reutenauer

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 25

Top Topics

Top Venues

Theor. Comput. Sci.

Adv. Appl. Math.

Univ. Paris (PHD)

Education History

Univ. Paris

PHD

Publications

Dominique Perrin, Christophe Reutenauer
The palindromization map. Discret. Appl. Math. 340 (2023)
Dominique Perrin, Christophe Reutenauer
Graded alphabets, circular codes, free Lie algebras and comma-free codes. Discret. Math. 344 (1) (2021)
Claudia Malvenuto, Christophe Reutenauer
Primitive elements of the Hopf algebras of tableaux. Eur. J. Comb. 98 (2021)
Antoine Abram, Nathan Chapelier-Laget, Christophe Reutenauer
An Order on Circular Permutations. Electron. J. Comb. 28 (3) (2021)
Christophe Reutenauer
Christoffel words and weak Markoff theory. Adv. Appl. Math. 127 (2021)
Antoine Abram, Mélodie Lapointe, Christophe Reutenauer
Palindromization and construction of Markoff triples. Theor. Comput. Sci. 809 (2020)
Antoine Abram, Mélodie Lapointe, Christophe Reutenauer
Reprint of: Palindromization and construction of Markoff triples. Theor. Comput. Sci. 834 (2020)
Francesco Dolce, Antonio Restivo, Christophe Reutenauer
Some variations on Lyndon words. CoRR (2019)
Francesco Dolce, Antonio Restivo, Christophe Reutenauer
Some Variations on Lyndon Words (Invited Talk). CPM (2019)
Benjamin Blanchette, Christian Choffrut, Christophe Reutenauer
Quasi-automatic semigroups. Theor. Comput. Sci. 777 (2019)
Benjamin Blanchette, Christian Choffrut, Christophe Reutenauer
Quasi-automatic semigroups. CoRR (2019)
Francesco Dolce, Antonio Restivo, Christophe Reutenauer
On generalized Lyndon words. Theor. Comput. Sci. 777 (2019)
Jean-Éric Pin, Christophe Reutenauer
A Mahler's Theorem for Word Functions. ICALP (2019)
Francesco Dolce, Antonio Restivo, Christophe Reutenauer
On generalized Lyndon words. CoRR (2018)
Dominique Perrin, Christophe Reutenauer
Hall sets, Lazard sets and comma-free codes. Discret. Math. 341 (1) (2018)
Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer
Preface. Int. J. Found. Comput. Sci. 29 (5) (2018)
Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
Birecurrent sets. Int. J. Algebra Comput. 28 (4) (2018)
Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
Recurrent and birecurrent sets. CoRR (2017)
Robert Cori, Christophe Reutenauer
On Sillke's bijection. Theor. Comput. Sci. 658 (2017)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular sets. Theor. Comput. Sci. 684 (2017)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Maximal bifix decoding. Discret. Math. 338 (5) (2015)
Sébastien Labbé, Christophe Reutenauer
A d-dimensional Extension of Christoffel Words. Discret. Comput. Geom. 54 (1) (2015)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular Sets. WORDS (2015)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular sets. CoRR (2015)
Christophe Reutenauer
Studies on finite Sturmian words. Theor. Comput. Sci. 591 (2015)
Sébastien Labbé, Christophe Reutenauer
A d-dimensional extension of Christoffel words. CoRR (2014)
Srecko Brlek, Christophe Reutenauer, Jean-Guy Penaud
Generation of Combinatorial Structures. Theor. Comput. Sci. 502 (2013)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes in acyclic sets. CoRR (2013)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Return words in interval exchange transformations CoRR (2013)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes and the finite index basis property CoRR (2013)
Christophe Reutenauer
On a Matrix Representation for Polynomially Recursive Sequences. Electron. J. Comb. 19 (3) (2012)
Ira M. Gessel, Antonio Restivo, Christophe Reutenauer
A bijection between words and multisets of necklaces. Eur. J. Comb. 33 (7) (2012)
Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33 (7) (2012)
Geneviève Paquin, Christophe Reutenauer
On the superimposition of Christoffel words. Theor. Comput. Sci. 412 (4-5) (2011)
Srecko Brlek, Christophe Reutenauer
Complexity and palindromic defect of infinite words. Theor. Comput. Sci. 412 (4-5) (2011)
Alessandro De Luca, Christophe Reutenauer
Christoffel Words and the Calkin-Wilf Tree. Electron. J. Comb. 18 (2) (2011)
Jean-Christophe Novelli, Christophe Reutenauer, Jean-Yves Thibon
Generalized descent patterns in permutations and associated Hopf algebras. Eur. J. Comb. 32 (4) (2011)
Claudia Malvenuto, Christophe Reutenauer
A self paired Hopf algebra on double posets and a Littlewood-Richardson rule. J. Comb. Theory, Ser. A 118 (4) (2011)
Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes and Sturmian words CoRR (2010)
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer
Lyndon + Christoffel = digitally convex. Pattern Recognit. 42 (10) (2009)
Yann Bugeaud, Christophe Reutenauer, Samir Siksek
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers. Theor. Comput. Sci. 410 (30-32) (2009)
Christophe Reutenauer
Michel Fliess and non-commutative formal power series. Int. J. Control 81 (3) (2008)
Jean Berstel, Christophe Reutenauer
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. Theor. Comput. Sci. 400 (1-3) (2008)
Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin
Codes and Noncommutative Stochastic Matrices CoRR (2008)
Valérie Berthé, Aldo de Luca, Christophe Reutenauer
On an involution of Christoffel words and Sturmian morphisms. Eur. J. Comb. 29 (2) (2008)
Christian Kassel, Christophe Reutenauer
A palindromization map for the free group. Theor. Comput. Sci. 409 (3) (2008)
Jean Berstel, Christophe Reutenauer
Another proof of Soittola's theorem. Theor. Comput. Sci. 393 (1-3) (2008)
Srecko Brlek, Christophe Reutenauer
Preface. Theor. Comput. Sci. 380 (3) (2007)
Sylvain Lavallée, Christophe Reutenauer
On a zeta function associated with automata and codes. Theor. Comput. Sci. 381 (1-3) (2007)
Jean-Pierre Borel, Christophe Reutenauer
On Christoffel classes. RAIRO Theor. Informatics Appl. 40 (1) (2006)
Jean-Pierre Borel, Christophe Reutenauer
Palindromic factors of billiard words. Theor. Comput. Sci. 340 (1) (2005)
Peter McNamara, Christophe Reutenauer
P-Partitions and a Multi-Parameter Klyachko Idempotent. Electron. J. Comb. 11 (2) (2005)
Jean-Pierre Borel, Christophe Reutenauer
Some New Results on Palindromic Factors of Billiard Words. Developments in Language Theory (2005)
Srecko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer
On The Palindromic Complexity Of Infinite Words. Int. J. Found. Comput. Sci. 15 (2) (2004)
Srecko Brlek, Christophe Reutenauer
Dédié à Jean Berstel Theor. Comput. Sci. 292 (1) (2003)
Christophe Hohlweg, Christophe Reutenauer
Lyndon words, permutations and trees. Theor. Comput. Sci. 307 (1) (2003)
Frédéric Patras, Christophe Reutenauer
On Dynkin and Klyachko Idempotents in Graded Bialgebras. Adv. Appl. Math. 28 (3-4) (2002)
Christophe Hohlweg, Christophe Reutenauer
Inverses of Words and the Parabolic Structure of the Symmetric Group. Eur. J. Comb. 22 (8) (2001)
P. M. Cohn, Christophe Reutenauer
On the Construction of the Free Field. Int. J. Algebra Comput. 9 (3-4) (1999)
Véronique Bruyère, Christophe Reutenauer
A Proof of Choffrut's Theorem on Subsequential Functions. Theor. Comput. Sci. 215 (1-2) (1999)
Claudia Malvenuto, Christophe Reutenauer
Plethysm and conjugation of quasi-symmetric functions. Discret. Math. 193 (1-3) (1998)
Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer
Cyclic Languages and Strongly Cyclic Languages. STACS (1996)
Christophe Reutenauer, Marcel Paul Schützenberger
Variétés et fonctions rationnelles. Theor. Comput. Sci. 145 (1&2) (1995)
Pierre Leroux, Christophe Reutenauer
Foreword/Avant-propos. Discret. Math. 139 (1-3) (1995)
Christophe Reutenauer
A Survey of Noncommutative Rational Series. Formal Power Series and Algebraic Combinatorics (1994)
Claudia Malvenuto, Christophe Reutenauer
Evacuation of labelled graphs. Discret. Math. 132 (1-3) (1994)
Guy Melançon, Christophe Reutenauer
Computing Hall exponents in the Free Group. Int. J. Algebra Comput. 3 (3) (1993)
Ira M. Gessel, Christophe Reutenauer
Counting Permutations with Given Cycle Structure and Descent Set. J. Comb. Theory, Ser. A 64 (2) (1993)
Anders Björner, Christophe Reutenauer
Rationality of the Möbius Function of Subword Order. Theor. Comput. Sci. 98 (1) (1992)
Christophe Reutenauer, Marcel Paul Schützenberger
Minimization of Rational Word Functions. SIAM J. Comput. 20 (4) (1991)
François Bergeron, Christophe Reutenauer
Combinatorial Resolution of Systems of Differential Equations III: a Special Class of Differentially Algebraic Series. Eur. J. Comb. 11 (6) (1990)
Christophe Reutenauer
Subsequential Functions: Characterizations, Minimization, Examples. IMYCS (1990)
Jean Berstel, Christophe Reutenauer
Zeta Functions of Recognizable Languages. ICALP (1988)
Antonio Restivo, Christophe Reutenauer
Rational Languages and the Burnside Problem. Theor. Comput. Sci. 40 (1985)
Christophe Reutenauer
Recent results on codes. FCT (1985)
Christophe Reutenauer
Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene. RAIRO Theor. Informatics Appl. 19 (3) (1985)
Christophe Reutenauer
The Shuffle Algebra on the Factors of a Word Is Free. J. Comb. Theory, Ser. A 38 (1) (1985)
Antonio Restivo, Christophe Reutenauer
On Cancellation Properties of Languages which are Supports of Ration Power Series. J. Comput. Syst. Sci. 29 (2) (1984)
Gérard Jacob, Christophe Reutenauer
On Formal Power Series Defined by Infinite Linear Systems. Theor. Comput. Sci. 32 (1984)
Antonio Restivo, Christophe Reutenauer
Cancellation, Pumping and Permutation in Formal Languages. ICALP (1984)
Antonio Restivo, Christophe Reutenauer
Some Applications of a Theorem of Shirshov to Language Theory Inf. Control. 57 (2/3) (1983)
Jean Berstel, Christophe Reutenauer
Recognizable Formal Power Series on Trees. Theor. Comput. Sci. 18 (1982)
Christophe Reutenauer
Biprefix Codes and Semisimple Algebras. ICALP (1982)
Christophe Reutenauer
A New Characterization of the Regular Languages. ICALP (1981)
Jean Berstel, Christophe Reutenauer
Séries formelles reconnaissables d'arbres et applications. CLAAP (1980)
Christophe Reutenauer
An Ogden-Like Iteration Lemma for Rational Power Series. Acta Informatica 13 (1980)
Christophe Reutenauer
On Polya series in noncommuting variables. FCT (1979)
Christophe Reutenauer
Sur les variétés de langages et de monoídes. Theoretical Computer Science (1979)
Christophe Reutenauer
Sur les Series Associees a Certains Systemes de Lindenmayer. Theor. Comput. Sci. 9 (1979)
Christophe Reutenauer
Sur les Series Rationnelles en Variables Non Commutatives. ICALP (1978)
Christophe Reutenauer
On a Question of S. Eilenberg. Theor. Comput. Sci. 5 (2) (1977)