Gwénaël Richomme

According to our database, Gwénaël Richomme authored at least 55 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Reconstructing Words Using Queries on Subwords or Factors.

Gwénaël Richomme, Matthieu Rosenfeld

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2021

On sets of indefinitely desubstitutable words.

Gwénaël Richomme

Theor. Comput. Sci., 2021

A Characterization of Binary Morphisms Generating Lyndon Infinite Words.

Gwénaël Richomme, Patrice Séébold

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2019

Coverability and multi-scale coverability on infinite pictures.

Guilhem Gamard, Gwénaël Richomme

J. Comput. Syst. Sci., 2019

Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property.

Gwénaël Richomme

Int. J. Found. Comput. Sci., 2019

2018

Avoidability of circular formulas.

Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold

Theor. Comput. Sci., 2018

Greedy Palindromic Lengths.

Michelangelo Bucci, Gwénaël Richomme

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

2017

Periodicity in rectangular arrays.

Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith

Inf. Process. Lett., 2017

A Characterization of Infinite LSP Words.

Gwénaël Richomme

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Determining Sets of Quasiperiods of Infinite Words.

Guilhem Gamard, Gwénaël Richomme

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions.

Guilhem Gamard, Gwénaël Richomme

CoRR, 2015

Coverability in Two Dimensions.

Guilhem Gamard, Gwénaël Richomme

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Minimal critical exponent of quasiperiodic words.

Gwénaël Richomme

Theor. Comput. Sci., 2014

2013

A Combinatorial Proof of S-adicity for Sequences with Linear Complexity.

Julien Leroy, Gwénaël Richomme

Integers, 2013

On Quasiperiodic Morphisms.

Florence Levé, Gwénaël Richomme

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms.

Gwénaël Richomme, Patrice Séébold

Theor. Comput. Sci., 2012

Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique".

Fabien Durand, Gwénaël Richomme

RAIRO Theor. Informatics Appl., 2012

Towards a statement of the S-adic conjecture through examples

Fabien Durand, Julien Leroy, Gwénaël Richomme

CoRR, 2012

2011

On factorially balanced sets of words.

Gwénaël Richomme, Patrice Séébold

Theor. Comput. Sci., 2011

On the fixed points of the iterated pseudopalindromic closure operator.

Damien Jamet, Geneviève Paquin, Gwénaël Richomme, Laurent Vuillon

Theor. Comput. Sci., 2011

Abelian complexity of minimal subshifts.

Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni

J. Lond. Math. Soc., 2011

Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity.

Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni

Int. J. Found. Comput. Sci., 2011

2010

Optimality of some algorithms to detect quasiperiodicities.

Richard Groult, Gwénaël Richomme

Theor. Comput. Sci., 2010

Standard factors of Sturmian words.

Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni

RAIRO Theor. Informatics Appl., 2010

Counting distinct palindromes in a word in linear time.

Richard Groult, Élise Prieur, Gwénaël Richomme

Inf. Process. Lett., 2010

Balance and Abelian complexity of the Tribonacci word.

Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni

Adv. Appl. Math., 2010

2009

Directive words of episturmian words: equivalences and normalization.

Amy Glen, Florence Levé, Gwénaël Richomme

RAIRO Theor. Informatics Appl., 2009

2008

Quasiperiodic and Lyndon episturmian words.

Amy Glen, Florence Levé, Gwénaël Richomme

Theor. Comput. Sci., 2008

2007

Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words.

Gwénaël Richomme

Theor. Comput. Sci., 2007

Quasiperiodic Sturmian words and morphisms.

Florence Levé, Gwénaël Richomme

Theor. Comput. Sci., 2007

Well quasi-orders generated by a word-shuffle rewriting.

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio

Theor. Comput. Sci., 2007

Sudo-Lyndon.

Gwénaël Richomme

Bull. EATCS, 2007

On Morphisms Preserving Infinite Lyndon Words.

Gwénaël Richomme

Discret. Math. Theor. Comput. Sci., 2007

Existence of finite test-sets for k-power-freeness of uniform morphisms.

Gwénaël Richomme, Francis Wlazinski

Discret. Appl. Math., 2007

A Local Balance Property of Episturmian Words.

Gwénaël Richomme

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Foreword.

Gwénaël Richomme

RAIRO Theor. Informatics Appl., 2006

Well Quasi Orders and the Shuffle Closure of Finite Sets.

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

On a conjecture about finite fixed points of morphisms.

Florence Levé, Gwénaël Richomme

Theor. Comput. Sci., 2005

2004

Some characterizations of Parikh matrix equivalent binary words.

S. Fossé, Gwénaël Richomme

Inf. Process. Lett., 2004

Conjectures And Results On Morphisms Generating K-Power-Free Words.

Gwénaël Richomme, Patrice Séébold

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

Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory).

Florence Levé, Gwénaël Richomme

Bull. EATCS, 2004

Overlap-free morphisms and finite test-sets.

Gwénaël Richomme, Francis Wlazinski

Discret. Appl. Math., 2004

2003

Conjugacy and episturmian morphisms.

Gwénaël Richomme

Theor. Comput. Sci., 2003

Some algorithms to compute the conjugates of Episturmian morphisms.

Gwénaël Richomme

RAIRO Theor. Informatics Appl., 2003

Some non finitely generated monoids of repetition-free endomorphisms.

Gwénaël Richomme

Inf. Process. Lett., 2003

2002

Some results on k-power-free morphisms.

Gwénaël Richomme, Francis Wlazinski

Theor. Comput. Sci., 2002

Finite Test-Sets for Overlap-Free Morphisms.

Gwénaël Richomme, Francis Wlazinski

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids.

Daniel Kirsten, Gwénaël Richomme

Theory Comput. Syst., 2001

2000

About Cube-Free Morphisms.

Gwénaël Richomme, Francis Wlazinski

Proceedings of the STACS 2000, 2000

1999

Another Characterization of Sturmian Words.

Gwénaël Richomme

Bull. EATCS, 1999

Characterization of Test-sets for Overlap-free Morphisms.

Gwénaël Richomme, Patrice Séébold

Discret. Appl. Math., 1999

1995

New Results on the Star Problem in Trace Monoids

Yves Métivier, Gwénaël Richomme

Inf. Comput., June, 1995

Computing the Closure of Sets of Words Under Partial Commutations.

Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract).

Yves Métivier, Gwénaël Richomme

Proceedings of the STACS 94, 1994

Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable.

Gwénaël Richomme

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994