Christophe Reutenauer

Jeffrey O. Shallit

RAIRO Theor. Informatics Appl., 2026

2025

A symmetry property of Christoffel words.

[BibT_eX]

[DOI]

Yan Lanciault

RAIRO Theor. Informatics Appl., 2025

On the conjugates of Christoffel words.

[BibT_eX]

[DOI]

Yann Bugeaud

Discret. Math. Theor. Comput. Sci., 2025

A generalization of perfectly clustering words and band bricks for certain gentle algebras.

[BibT_eX]

[DOI]

Hugh Thomas

Comb. Theory, 2025

Characterizations of Perfectly Clustering Words.

[BibT_eX]

[DOI]

Mélodie Lapointe

Electron. J. Comb., 2025

2023

The palindromization map.

[BibT_eX]

[DOI]

Discret. Appl. Math., December, 2023

2021

Primitive elements of the Hopf algebras of tableaux.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Graded alphabets, circular codes, free Lie algebras and comma-free codes.

[BibT_eX]

[DOI]

Discret. Math., 2021

An Order on Circular Permutations.

[BibT_eX]

[DOI]

Antoine Abram

Nathan Chapelier-Laget

Electron. J. Comb., 2021

Christoffel words and weak Markoff theory.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

Reprint of: Palindromization and construction of Markoff triples.

[BibT_eX]

[DOI]

Antoine Abram

Mélodie Lapointe

Theor. Comput. Sci., 2020

Palindromization and construction of Markoff triples.

[BibT_eX]

[DOI]

Antoine Abram

Mélodie Lapointe

Theor. Comput. Sci., 2020

2019

On generalized Lyndon words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Quasi-automatic semigroups.

[BibT_eX]

[DOI]

Benjamin Blanchette

Christian Choffrut

Theor. Comput. Sci., 2019

Some variations on Lyndon words.

[BibT_eX]

[DOI]

CoRR, 2019

A Mahler's Theorem for Word Functions.

[BibT_eX]

[DOI]

Jean-Éric Pin

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Some Variations on Lyndon Words (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Preface.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Int. J. Found. Comput. Sci., 2018

Birecurrent sets.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2018

Hall sets, Lazard sets and comma-free codes.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

On Sillke's bijection.

[BibT_eX]

[DOI]

Robert Cori

Theor. Comput. Sci., 2017

Recurrent and birecurrent sets.

[BibT_eX]

[DOI]

CoRR, 2017

2015

Studies on finite Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Maximal bifix decoding.

[BibT_eX]

[DOI]

Discret. Math., 2015

A d-dimensional Extension of Christoffel Words.

[BibT_eX]

[DOI]

Sébastien Labbé

Discret. Comput. Geom., 2015

Specular Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2013

Generation of Combinatorial Structures.

[BibT_eX]

[DOI]

Jean-Guy Penaud

Theor. Comput. Sci., 2013

Bifix codes and the finite index basis property

[BibT_eX]

[DOI]

CoRR, 2013

Return words in interval exchange transformations

[BibT_eX]

[DOI]

CoRR, 2013

Bifix codes in acyclic sets.

[BibT_eX]

[DOI]

CoRR, 2013

2012

A bijection between words and multisets of necklaces.

[BibT_eX]

[DOI]

Ira M. Gessel

Eur. J. Comb., 2012

Recent results on syntactic groups of prefix codes.

[BibT_eX]

[DOI]

Clelia de Felice

Eur. J. Comb., 2012

On a Matrix Representation for Polynomially Recursive Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

On the superimposition of Christoffel words.

[BibT_eX]

[DOI]

Geneviève Paquin

Theor. Comput. Sci., 2011

Complexity and palindromic defect of infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A self paired Hopf algebra on double posets and a Littlewood-Richardson rule.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Generalized descent patterns in permutations and associated Hopf algebras.

[BibT_eX]

[DOI]

Jean-Christophe Novelli

Jean-Yves Thibon

Eur. J. Comb., 2011

Christoffel Words and the Calkin-Wilf Tree.

[BibT_eX]

[DOI]

Alessandro De Luca

Electron. J. Comb., 2011

2010

Bifix codes and Sturmian words

[BibT_eX]

[DOI]

Clelia de Felice

CoRR, 2010

Codes and Automata.

[BibT_eX]

Encyclopedia of mathematics and its applications 129, Cambridge University Press, ISBN: 978-0-521-88831-8, 2010

2009

A Sturmian sequence related to the uniqueness conjecture for Markoff numbers.

[BibT_eX]

[DOI]

Yann Bugeaud

Samir Siksek

Theor. Comput. Sci., 2009

Lyndon + Christoffel = digitally convex.

[BibT_eX]

[DOI]

Jacques-Olivier Lachaud

Xavier Provençal

Pattern Recognit., 2009

2008

A palindromization map for the free group.

[BibT_eX]

[DOI]

Christian Kassel

Theor. Comput. Sci., 2008

Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Another proof of Soittola's theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Michel Fliess and non-commutative formal power series.

[BibT_eX]

[DOI]

Int. J. Control, 2008

On an involution of Christoffel words and Sturmian morphisms.

[BibT_eX]

[DOI]

Valérie Berthé

Aldo de Luca

Eur. J. Comb., 2008

Codes and Noncommutative Stochastic Matrices

[BibT_eX]

[DOI]

Sylvain Lavallée

Vladimir Retakh

CoRR, 2008

2007

On a zeta function associated with automata and codes.

[BibT_eX]

[DOI]

Sylvain Lavallée

Theor. Comput. Sci., 2007

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

On Christoffel classes.

[BibT_eX]

[DOI]

Jean-Pierre Borel

RAIRO Theor. Informatics Appl., 2006

2005

Palindromic factors of billiard words.

[BibT_eX]

[DOI]

Jean-Pierre Borel

Theor. Comput. Sci., 2005

P-Partitions and a Multi-Parameter Klyachko Idempotent.

[BibT_eX]

[DOI]

Peter McNamara

Electron. J. Comb., 2005

Some New Results on Palindromic Factors of Billiard Words.

[BibT_eX]

[DOI]

Jean-Pierre Borel

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

On The Palindromic Complexity Of Infinite Words.

[BibT_eX]

[DOI]

Sylvie Hamel

Maurice Nivat

Int. J. Found. Comput. Sci., 2004

2003

Lyndon words, permutations and trees.

[BibT_eX]

[DOI]

Christophe Hohlweg

Theor. Comput. Sci., 2003

On a valuation of rational subsets of Z<sup>k</sup> Dédié à Jean Berstel

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

On Dynkin and Klyachko Idempotents in Graded Bialgebras.

[BibT_eX]

[DOI]

Frédéric Patras

Adv. Appl. Math., 2002

2001

Inverses of Words and the Parabolic Structure of the Symmetric Group.

[BibT_eX]

[DOI]

Christophe Hohlweg

Eur. J. Comb., 2001

1999

A Proof of Choffrut's Theorem on Subsequential Functions.

[BibT_eX]

[DOI]

Véronique Bruyère

Theor. Comput. Sci., 1999

On the Construction of the Free Field.

[BibT_eX]

[DOI]

P. M. Cohn

Int. J. Algebra Comput., 1999

1998

Plethysm and conjugation of quasi-symmetric functions.

[BibT_eX]

[DOI]

Discret. Math., 1998

1996

Cyclic Languages and Strongly Cyclic Languages.

[BibT_eX]

[DOI]

Marie-Pierre Béal

Olivier Carton

Proceedings of the STACS 96, 1996

1995

Variétés et fonctions rationnelles.

[BibT_eX]

[DOI]

Marcel Paul Schützenberger

Theor. Comput. Sci., 1995

Foreword/Avant-propos.

[BibT_eX]

[DOI]

Pierre Leroux

Discret. Math., 1995

1994

Evacuation of labelled graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

A Survey of Noncommutative Rational Series.

[BibT_eX]

[DOI]

Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994

1993

Counting Permutations with Given Cycle Structure and Descent Set.

[BibT_eX]

Ira M. Gessel

J. Comb. Theory A, 1993

Computing Hall exponents in the Free Group.

[BibT_eX]

[DOI]

Guy Melançon

Int. J. Algebra Comput., 1993

1992

Rationality of the Möbius Function of Subword Order.

[BibT_eX]

[DOI]

Anders Björner

Theor. Comput. Sci., 1992

1991

Minimization of Rational Word Functions.

[BibT_eX]

[DOI]

Marcel Paul Schützenberger

SIAM J. Comput., 1991

1990

Combinatorial Resolution of Systems of Differential Equations III: a Special Class of Differentially Algebraic Series.

[BibT_eX]

[DOI]

François Bergeron

Eur. J. Comb., 1990

Subsequential Functions: Characterizations, Minimization, Examples.

[BibT_eX]

[DOI]

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1988

Zeta Functions of Recognizable Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Rational series and their languages.

[BibT_eX]

[DOI]

EATCS monographs on theoretical computer science 12, Springer, ISBN: 0387186263, 1988

1985

Rational Languages and the Burnside Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

The Shuffle Algebra on the Factors of a Word Is Free.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene.

[BibT_eX]

[DOI]