Gwénaël Richomme

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 19

Top Topics

Top Venues

Theor. Comput. Sci.

Int. J. Found. Comput. Sci.

Publications

Gwénaël Richomme, Matthieu Rosenfeld
Reconstructing Words Using Queries on Subwords or Factors. STACS (2023)
Gwénaël Richomme, Matthieu Rosenfeld
Reconstructing words using queries on subwords or factors. CoRR (2023)
Gwénaël Richomme, Patrice Séébold
A characterization of binary morphisms generating Lyndon infinite words. CoRR (2021)
Gwénaël Richomme, Patrice Séébold
A Characterization of Binary Morphisms Generating Lyndon Infinite Words. WORDS (2021)
Gwénaël Richomme
On sets of indefinitely desubstitutable words. Theor. Comput. Sci. 857 (2021)
Gwénaël Richomme
On sets of indefinitely desubstitutable words. CoRR (2020)
Guilhem Gamard, Gwénaël Richomme
Coverability and multi-scale coverability on infinite pictures. J. Comput. Syst. Sci. 104 (2019)
Gwénaël Richomme
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property. Int. J. Found. Comput. Sci. 30 (1) (2019)
Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
Avoidability of circular formulas. Theor. Comput. Sci. 726 (2018)
Michelangelo Bucci, Gwénaël Richomme
Greedy Palindromic Lengths. Int. J. Found. Comput. Sci. 29 (3) (2018)
Gwénaël Richomme
Characterization of infinite LSP words and endomorphisms preserving the LSP property. CoRR (2018)
Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith
Periodicity in rectangular arrays. Inf. Process. Lett. 118 (2017)
Gwénaël Richomme
A Characterization of Infinite LSP Words. DLT (2017)
Gwénaël Richomme
A Characterization of Infinite LSP Words. CoRR (2017)
Guilhem Gamard, Gwénaël Richomme
Determining Sets of Quasiperiods of Infinite Words. MFCS (2016)
Michelangelo Bucci, Gwénaël Richomme
Greedy palindromic lengths. CoRR (2016)
Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
Avoidability of circular formulas. CoRR (2016)
Guilhem Gamard, Gwénaël Richomme
Coverability in Two Dimensions. LATA (2015)
Guilhem Gamard, Gwénaël Richomme
Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. CoRR (2015)
Gwénaël Richomme
Minimal critical exponent of quasiperiodic words. Theor. Comput. Sci. 548 (2014)
Florence Levé, Gwénaël Richomme
On Quasiperiodic Morphisms CoRR (2013)
Julien Leroy, Gwénaël Richomme
A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers 13 (2013)
Florence Levé, Gwénaël Richomme
On Quasiperiodic Morphisms. WORDS (2013)
Fabien Durand, Gwénaël Richomme
Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. 46 (1) (2012)
Gwénaël Richomme, Patrice Séébold
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. Theor. Comput. Sci. 428 (2012)
Fabien Durand, Julien Leroy, Gwénaël Richomme
Towards a statement of the S-adic conjecture through examples CoRR (2012)
Gwénaël Richomme, Patrice Séébold
On factorially balanced sets of words. Theor. Comput. Sci. 412 (39) (2011)
Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Abelian complexity of minimal subshifts. J. Lond. Math. Soc. 83 (1) (2011)
Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. 22 (4) (2011)
Damien Jamet, Geneviève Paquin, Gwénaël Richomme, Laurent Vuillon
On the fixed points of the iterated pseudopalindromic closure operator. Theor. Comput. Sci. 412 (27) (2011)
Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. 45 (2) (2010)
Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Avoiding Abelian powers in binary words with bounded Abelian complexity CoRR (2010)
Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
Standard factors of Sturmian words. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Richard Groult, Élise Prieur, Gwénaël Richomme
Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110 (20) (2010)
Richard Groult, Gwénaël Richomme
Optimality of some algorithms to detect quasiperiodicities. Theor. Comput. Sci. 411 (34-36) (2010)
Amy Glen, Florence Levé, Gwénaël Richomme
Directive words of episturmian words: equivalences and normalization. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Amy Glen, Florence Levé, Gwénaël Richomme
Quasiperiodic and Lyndon episturmian words CoRR (2008)
Amy Glen, Florence Levé, Gwénaël Richomme
Quasiperiodic and Lyndon episturmian words. Theor. Comput. Sci. 409 (3) (2008)
Amy Glen, Florence Levé, Gwénaël Richomme
Directive words of episturmian words: equivalences and normalization CoRR (2008)
Gwénaël Richomme
On Morphisms Preserving Infinite Lyndon Words. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Gwénaël Richomme
Sudo-Lyndon CoRR (2007)
Gwénaël Richomme
A local balance property of episturmian words CoRR (2007)
Gwénaël Richomme
Sudo-Lyndon. Bull. EATCS 92 (2007)
Gwénaël Richomme, Francis Wlazinski
Existence of finite test-sets for k-power-freeness of uniform morphisms. Discret. Appl. Math. 155 (15) (2007)
Gwénaël Richomme
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theor. Comput. Sci. 380 (3) (2007)
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
Well quasi-orders generated by a word-shuffle rewriting. Theor. Comput. Sci. 377 (1-3) (2007)
Florence Levé, Gwénaël Richomme
Quasiperiodic Sturmian words and morphisms. Theor. Comput. Sci. 372 (1) (2007)
Gwénaël Richomme
A Local Balance Property of Episturmian Words. Developments in Language Theory (2007)
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
Well Quasi Orders and the Shuffle Closure of Finite Sets. Developments in Language Theory (2006)
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
Well quasi-orders and the shuffle closure of finite sets CoRR (2006)
Gwénaël Richomme
Foreword. RAIRO Theor. Informatics Appl. 40 (3) (2006)
Florence Levé, Gwénaël Richomme
Quasiperiodic Sturmian words and morphisms CoRR (2006)
Gwénaël Richomme, Francis Wlazinski
Existence of finite test-sets for k-power-freeness of uniform morphisms CoRR (2005)
Florence Levé, Gwénaël Richomme
On a conjecture about finite fixed points of morphisms. Theor. Comput. Sci. 339 (1) (2005)
S. Fossé, Gwénaël Richomme
Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Lett. 92 (2) (2004)
Gwénaël Richomme, Patrice Séébold
Conjectures And Results On Morphisms Generating K-Power-Free Words. Int. J. Found. Comput. Sci. 15 (2) (2004)
Gwénaël Richomme, Francis Wlazinski
Overlap-free morphisms and finite test-sets. Discret. Appl. Math. 143 (1-3) (2004)
Florence Levé, Gwénaël Richomme
Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory). Bull. EATCS 84 (2004)
Gwénaël Richomme
Some non finitely generated monoids of repetition-free endomorphisms. Inf. Process. Lett. 85 (2) (2003)
Gwénaël Richomme
Some algorithms to compute the conjugates of Episturmian morphisms. RAIRO Theor. Informatics Appl. 37 (1) (2003)
Gwénaël Richomme
Conjugacy and episturmian morphisms. Theor. Comput. Sci. 302 (1-3) (2003)
Gwénaël Richomme, Francis Wlazinski
Finite Test-Sets for Overlap-Free Morphisms. MFCS (2002)
Gwénaël Richomme, Francis Wlazinski
Some results on k-power-free morphisms. Theor. Comput. Sci. 273 (1-2) (2002)
Daniel Kirsten, Gwénaël Richomme
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. Theory Comput. Syst. 34 (3) (2001)
Gwénaël Richomme, Francis Wlazinski
About Cube-Free Morphisms. STACS (2000)
Gwénaël Richomme, Patrice Séébold
Characterization of Test-sets for Overlap-free Morphisms. Discret. Appl. Math. 98 (1-2) (1999)
Gwénaël Richomme
Another Characterization of Sturmian Words. Bull. EATCS 67 (1999)
Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier
Computing the Closure of Sets of Words Under Partial Commutations. ICALP (1995)
Yves Métivier, Gwénaël Richomme
New Results on the Star Problem in Trace Monoids Inf. Comput. 119 (2) (1995)
Yves Métivier, Gwénaël Richomme
On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). STACS (1994)
Gwénaël Richomme
Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. MFCS (1994)