2024
Christoffel Matrices and Sturmian Determinants.
CoRR, 2024
A Symmetry Property of Christoffel Words.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024
2023
The palindromization map.
Discret. Appl. Math., December, 2023
2021
Primitive elements of the Hopf algebras of tableaux.
Eur. J. Comb., 2021
Graded alphabets, circular codes, free Lie algebras and comma-free codes.
Discret. Math., 2021
An Order on Circular Permutations.
Electron. J. Comb., 2021
Christoffel words and weak Markoff theory.
Adv. Appl. Math., 2021
2020
Reprint of: Palindromization and construction of Markoff triples.
Theor. Comput. Sci., 2020
Palindromization and construction of Markoff triples.
Theor. Comput. Sci., 2020
2019
On generalized Lyndon words.
Theor. Comput. Sci., 2019
Quasi-automatic semigroups.
Theor. Comput. Sci., 2019
Some variations on Lyndon words.
CoRR, 2019
A Mahler's Theorem for Word Functions.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Some Variations on Lyndon Words (Invited Talk).
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019
2018
Int. J. Found. Comput. Sci., 2018
Int. J. Algebra Comput., 2018
Hall sets, Lazard sets and comma-free codes.
Discret. Math., 2018
2017
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
Recurrent and birecurrent sets.
CoRR, 2017
2015
Studies on finite Sturmian words.
Theor. Comput. Sci., 2015
A d-dimensional Extension of Christoffel Words.
Discret. Comput. Geom., 2015
2013
Generation of Combinatorial Structures.
Theor. Comput. Sci., 2013
Bifix codes and the finite index basis property
CoRR, 2013
Return words in interval exchange transformations
CoRR, 2013
Bifix codes in acyclic sets.
CoRR, 2013
2012
A bijection between words and multisets of necklaces.
Eur. J. Comb., 2012
Recent results on syntactic groups of prefix codes.
Eur. J. Comb., 2012
On a Matrix Representation for Polynomially Recursive Sequences.
Electron. J. Comb., 2012
2011
On the superimposition of Christoffel words.
Theor. Comput. Sci., 2011
Complexity and palindromic defect of infinite words.
Theor. Comput. Sci., 2011
A self paired Hopf algebra on double posets and a Littlewood-Richardson rule.
J. Comb. Theory A, 2011
Generalized descent patterns in permutations and associated Hopf algebras.
Eur. J. Comb., 2011
Christoffel Words and the Calkin-Wilf Tree.
Electron. J. Comb., 2011
2010
Bifix codes and Sturmian words
CoRR, 2010
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.
Theor. Comput. Sci., 2009
Lyndon + Christoffel = digitally convex.
Pattern Recognit., 2009
2008
A palindromization map for the free group.
Theor. Comput. Sci., 2008
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.
Theor. Comput. Sci., 2008
Another proof of Soittola's theorem.
Theor. Comput. Sci., 2008
Michel Fliess and non-commutative formal power series.
Int. J. Control, 2008
On an involution of Christoffel words and Sturmian morphisms.
Eur. J. Comb., 2008
Codes and Noncommutative Stochastic Matrices
CoRR, 2008
2007
On a zeta function associated with automata and codes.
Theor. Comput. Sci., 2007
Theor. Comput. Sci., 2007
2006
RAIRO Theor. Informatics Appl., 2006
2005
Palindromic factors of billiard words.
Theor. Comput. Sci., 2005
P-Partitions and a Multi-Parameter Klyachko Idempotent.
Electron. J. Comb., 2005
Some New Results on Palindromic Factors of Billiard Words.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005
2004
On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci., 2004
2003
Lyndon words, permutations and trees.
Theor. Comput. Sci., 2003
On a valuation of rational subsets of Z<sup>k</sup> Dédié à Jean Berstel
Theor. Comput. Sci., 2003
2002
On Dynkin and Klyachko Idempotents in Graded Bialgebras.
Adv. Appl. Math., 2002
2001
Inverses of Words and the Parabolic Structure of the Symmetric Group.
Eur. J. Comb., 2001
1999
A Proof of Choffrut's Theorem on Subsequential Functions.
Theor. Comput. Sci., 1999
On the Construction of the Free Field.
Int. J. Algebra Comput., 1999
1998
Plethysm and conjugation of quasi-symmetric functions.
Discret. Math., 1998
1996
Cyclic Languages and Strongly Cyclic Languages.
Proceedings of the STACS 96, 1996
1995
Variétés et fonctions rationnelles.
Theor. Comput. Sci., 1995
1994
Evacuation of labelled graphs.
Discret. Math., 1994
A Survey of Noncommutative Rational Series.
Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994
1993
Counting Permutations with Given Cycle Structure and Descent Set.
J. Comb. Theory A, 1993
Computing Hall exponents in the Free Group.
Int. J. Algebra Comput., 1993
1992
Rationality of the Möbius Function of Subword Order.
Theor. Comput. Sci., 1992
1991
Minimization of Rational Word Functions.
SIAM J. Comput., 1991
1990
Combinatorial Resolution of Systems of Differential Equations III: a Special Class of Differentially Algebraic Series.
Eur. J. Comb., 1990
Subsequential Functions: Characterizations, Minimization, Examples.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990
1988
Zeta Functions of Recognizable Languages.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
Rational series and their languages.
EATCS monographs on theoretical computer science 12, Springer, ISBN: 0387186263, 1988
1985
Rational Languages and the Burnside Problem.
Theor. Comput. Sci., 1985
The Shuffle Algebra on the Factors of a Word Is Free.
J. Comb. Theory A, 1985
Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene.
RAIRO Theor. Informatics Appl., 1985
Proceedings of the Fundamentals of Computation Theory, 1985
1984
On Formal Power Series Defined by Infinite Linear Systems.
Theor. Comput. Sci., 1984
On Cancellation Properties of Languages which are Supports of Ration Power Series.
J. Comput. Syst. Sci., 1984
Cancellation, Pumping and Permutation in Formal Languages.
Proceedings of the Automata, 1984
1983
Some Applications of a Theorem of Shirshov to Language Theory
Inf. Control., 1983
1982
Recognizable Formal Power Series on Trees.
Theor. Comput. Sci., 1982
Biprefix Codes and Semisimple Algebras.
Proceedings of the Automata, 1982
1981
A New Characterization of the Regular Languages.
Proceedings of the Automata, 1981
1980
An Ogden-Like Iteration Lemma for Rational Power Series.
Acta Informatica, 1980
Séries formelles reconnaissables d'arbres et applications.
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980
Series rationnelles et algebres syntactiques.
PhD thesis, 1980
1979
Sur les Series Associees a Certains Systemes de Lindenmayer.
Theor. Comput. Sci., 1979
Sur les variétés de langages et de monoídes.
Proceedings of the Theoretical Computer Science, 1979
On Polya series in noncommuting variables.
Proceedings of the Fundamentals of Computation Theory, 1979
1978
Sur les Series Rationnelles en Variables Non Commutatives.
Proceedings of the Automata, 1978
1977
On a Question of S. Eilenberg.
Theor. Comput. Sci., 1977
