Gwenaël Richomme

Présentation

Autres informations disponible sur ma page web/Other available informations on my web page : ici/here

Remarque : certaines informations sont en double (cause double saisie par co-auteurs)

Publications

Article dans une revue (42)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words Gwenaël Richomme Theoretical Computer Science, 2025, 1066, pp.115732. ⟨10.1016/j.tcs.2025.115732⟩ Article dans une revue lirmm-05302654v1
On sets of indefinitely desubstitutable words Gwenaël Richomme Theoretical Computer Science, 2021, 857, pp.97-113. ⟨10.1016/j.tcs.2021.01.004⟩ Article dans une revue lirmm-03005771v1
Coverability and multi-scale coverability on infinite pictures Guilhem Gamard,Gwenaël Richomme Journal of Computer and System Sciences, 2019, 104, pp.258-277. ⟨10.1016/j.jcss.2017.05.001⟩ Article dans une revue lirmm-01176543v1
Characterization of infinite LSP words and endomorphisms preserving the LSP property Gwenaël Richomme International Journal of Foundations of Computer Science, 2019, 30 (1), pp.171-196. ⟨10.1142/S0129054119400082⟩ Article dans une revue lirmm-01855460v1
Avoidability of circular formulas Guilhem Gamard,Pascal Ochem,Gwenaël Richomme,Patrice Séébold Theoretical Computer Science, 2018, 726, pp.1-4. ⟨10.1016/j.tcs.2017.11.014⟩ Article dans une revue lirmm-01692716v1
Greedy Palindromic Lengths Michelangelo Bucci,Gwenaël Richomme International Journal of Foundations of Computer Science, 2018, 29 (03), pp.331- 356. ⟨10.1142/S0129054118500077⟩ Article dans une revue lirmm-01796733v1
Periodicity in rectangular arrays Guilhem Gamard,Gwenaël Richomme,Jeffrey Shallit,Taylor J. Smith Information Processing Letters, 2017, 118, pp.58-63. ⟨10.1016/j.ipl.2016.09.011⟩ Article dans une revue lirmm-01378894v1
Minimal critical exponent of quasiperiodic words Gwenaël Richomme Theoretical Computer Science, 2014, 548, pp.117-122. ⟨10.1016/j.tcs.2014.06.039⟩ Article dans une revue lirmm-01059541v1
A Combinatorial Proof of S-adicity for Sequences with Linear Complexity Julien Leroy,Gwenaël Richomme Integers : Electronic Journal of Combinatorial Number Theory, 2013, 13, pp.article #A5. ⟨10.1515/9783110298161.50⟩ Article dans une revue lirmm-00797658v1
Do the Properties of an S-adic Representation Determine Factor Complexity? Fabien Durand,Julien Leroy,Gwenaël Richomme Journal of Integer Sequences, 2013, 16 (2), pp.Art 13.2.6 Article dans une revue lirmm-00797654v1
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms Gwenaël Richomme,Patrice Séébold Theoretical Computer Science, 2012, 428, pp.92-97. ⟨10.1016/j.tcs.2011.12.008⟩ Article dans une revue lirmm-00797672v1
On Factorially Balanced Sets of Words Gwenaël Richomme,Patrice Séébold Theoretical Computer Science, 2011, 412 (39), pp.5492-5497. ⟨10.1016/j.tcs.2011.06.027⟩ Article dans une revue istex lirmm-00616826v1
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity Julien Cassaigne,Gwenaël Richomme,Kalle Saari,Luca Q. Zamboni International Journal of Foundations of Computer Science, 2011, 22 (4), pp.905-920. ⟨10.1142/S0129054111008489⟩ Article dans une revue lirmm-00601553v1
On the fixed points of the iterated pseudopalindromic closure operator Damien Jamet,Geneviève Paquin,Gwenaël Richomme,Laurent Vuillon Theoretical Computer Science, 2011, 412 (27), pp.2974-2987. ⟨10.1016/j.tcs.2010.03.018⟩ Article dans une revue hal-00580665v1
Abelian Complexity of Minimal subshifts Gwenaël Richomme,Kalle Saari,Luca Q. Zamboni Journal of the London Mathematical Society, 2011, 83 (1), pp.79-95. ⟨10.1112/jlms/jdq063⟩ Article dans une revue lirmm-00598086v1
Balance and Abelian Complexity of the Tribonacci word Gwenaël Richomme,Kalle Saari,Luca Q. Zamboni Advances in Applied Mathematics, 2010, 45 (2), pp.212-231. ⟨10.1016/j.aam.2010.01.006⟩ Article dans une revue hal-00599750v1
Optimality of some algorithms to detect quasiperiodicities Richard Groult,Gwenaël Richomme Theoretical Computer Science, 2010, 411 (34-36), pp.3110-3122. ⟨10.1016/j.tcs.2010.04.039⟩ Article dans une revue istex hal-00599751v1
Standard Factors of Sturmian Words Gwenaël Richomme,Kalle Saari,Luca Q. Zamboni RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2010, 44 (1), pp.159-174. ⟨10.1051/ita/2010011⟩ Article dans une revue hal-00599748v1
Counting distinct palindromes in a word in linear time Richard Groult,Elise Prieur-Gaston,Gwenaël Richomme Information Processing Letters, 2010, 110, pp.908-912. ⟨10.1016/j.ipl.2010.07.018⟩ Article dans une revue istex hal-00507481v1
Directive words of episturmian words: equivalences and normalization Amy Glen,Florence Levé,Gwenaël Richomme RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2009, 43 (2), pp.299-319. ⟨10.1051/ita:2008029⟩ Article dans une revue hal-00599746v1
Quasiperiodic and Lyndon episturmian words Amy Glen,Florence Levé,Gwenaël Richomme Theoretical Computer Science, 2008, 409 (3), pp.578-600 Article dans une revue hal-00599745v1
Well quasi-orders and the shuffle closure of finite sets Flavio d'Alessandro,Gwenaël Richomme,Stefano Varrichio Theoretical Computer Science, 2007, 377, pp.73-92 Article dans une revue hal-00085839v1
Sudo-Lyndon Gwenaël Richomme Bulletin- European Association for Theoretical Computer Science, 2007, 92, pp.143-149 Article dans une revue hal-00130231v1
Quasiperiodic Sturmian words and morphisms Florence Levé,Gwenaël Richomme Theoretical Computer Science, 2007, 372 (1), pp.15-25 Article dans une revue hal-00016679v1
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words Gwenaël Richomme Theoretical Computer Science, 2007, 380, pp.393-400 Article dans une revue hal-00599742v1
On morphisms preserving infinite Lyndon words Gwenaël Richomme Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.89-108. ⟨10.46298/dmtcs.411⟩ Article dans une revue hal-00599743v1
Existence of finite test-sets for k-power-freeness of uniform morphisms Gwenaël Richomme,Francis Wlazinski Discrete Applied Mathematics, 2007, 155 (15), pp.2001-2016 Article dans une revue hal-00015775v1
On a conjecture about finite fixed points of morphisms Gwenaël Richomme,Florence Levé Theoretical Computer Science, 2005, 339, pp.103-128 Article dans une revue hal-00599741v1
Conjectures and results on morphisms generating k-power-free words Gwenaël Richomme,Patrice Séébold International Journal of Foundations of Computer Science, 2004, 15 (2), pp.307-316 Article dans une revue hal-00598220v1
Some characterizations of Parikh matrix equivalent binary words Stéphane Fossé,Gwenaël Richomme Information Processing Letters, 2004, 92 (2), pp.77-82 Article dans une revue hal-00598222v1
Overlap-free morphisms and finite test-sets Gwenaël Richomme,Francis Wlazinski Discrete Applied Mathematics, 2004, 143 (1-3), pp.92-109 Article dans une revue hal-00598221v1
Quasiperiodic infinite words: some answers Florence Levé,Gwenaël Richomme Bulletin- European Association for Theoretical Computer Science, 2004, 84, pp.128-138 Article dans une revue hal-00599752v1
Some algorithms to compute the conjugates of episturmian morphisms Gwenaël Richomme RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2003, 37, pp.85-104 Article dans une revue hal-00598218v1
Lyndon morphisms Gwenaël Richomme Bulletin of the Belgian Mathematical Society - Simon Stevin, 2003, 10 (5), pp.761-785 Article dans une revue hal-00598219v1
Conjugacy and episturmian morphisms Gwenaël Richomme Theoretical Computer Science, 2003, 302, pp.1-34 Article dans une revue hal-00598216v1
Some non finitely generated monoids of repetition-free endomorphisms Gwenaël Richomme Information Processing Letters, 2003, 85 (2), pp.61-66 Article dans une revue hal-00598217v1
Some results on k-power-free morphisms Gwenaël Richomme,Francis Wlazinski Theoretical Computer Science, 2002, 273, pp.119-142 Article dans une revue hal-00598215v1
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids Daniel Kirsten,Gwenaël Richomme Theory of Computing Systems, 2001, 34, pp.193-217. ⟨10.1007/s00224-001-0006-x⟩ Article dans une revue hal-00598214v1
Test-words for Sturmian morphisms Gwenaël Richomme Bulletin of the Belgian Mathematical Society - Simon Stevin, 1999, 6 (4), pp.481-489 Article dans une revue hal-00598213v1
Characterization of test-sets for overlap-free morphisms Gwenaël Richomme,Patrice Séébold Discrete Applied Mathematics, 1999, 98, pp.151-157. ⟨10.1016/S0166-218X(99)00118-3⟩ Article dans une revue istex hal-00598210v1
Another characterization of Sturmian words (one more) Gwenaël Richomme Bulletin- European Association for Theoretical Computer Science, 1999, 67, pp.173-175 Article dans une revue hal-00599754v1
New results on the star problem in trace monoids Yves Métivier,Gwenaël Richomme Information and Computation, 1995, 119, pp.240-251 Article dans une revue hal-00307447v1

Communication dans un congrès (15)

Reconstructing words using queries on subwords or factors Gwenaël Richomme,Matthieu Rosenfeld STACS 2023 - 40th International Symposium on Theoretical Aspects of Computer Science, Mar 2023, Hambourg, Germany. pp.52:1-52:15, ⟨10.4230/LIPIcs.STACS.2023.52⟩ Communication dans un congrès hal-03922190v2
A characterization of binary morphisms generating Lyndon infinite words Gwenaël Richomme,Patrice Séébold WORDS 2021 - 13th International Conference on Combinatorics on Words, Sep 2021, Rouen, France. pp.160-171, ⟨10.1007/978-3-030-85088-3_14⟩ Communication dans un congrès lirmm-03213221v1
On Families of Limit S-adic Words Gwenaël Richomme WORDS 2019 - 12th International Conference on Combinatorics on Words, Sep 2019, Loughborough, United Kingdom. pp.9-11, ⟨10.1007/978-3-030-28796-2⟩ Communication dans un congrès lirmm-04713330v1
A Characterization of Infinite LSP Words Gwenaël Richomme DLT: Developments in Language Theory, Aug 2017, Liège, Belgium. pp.320-331, ⟨10.1007/978-3-319-62809-7_24⟩ Communication dans un congrès lirmm-01587263v1
Determining Sets of Quasiperiods of Infinite Words Guilhem Gamard,Gwenaël Richomme MFCS: Mathematical Foundations of Computer Science, Aug 2016, Cracovie, Poland. pp.40:1-40:13, ⟨10.4230/LIPIcs.MFCS.2016.40⟩ Communication dans un congrès lirmm-01369373v1
Coverability in Two Dimensions Guilhem Gamard,Gwenaël Richomme 9th International Conference on Language and Automata Theory and Applications (LATA), Mar 2015, Nice, France. pp.402-413, ⟨10.1007/978-3-319-15579-1_31⟩ Communication dans un congrès lirmm-01180026v1
Left greedy palindromic length Michelangelo Bucci,Gwenaël Richomme Journées Montoises d'Informatique Théorique, Sep 2014, Nancy, France Communication dans un congrès lirmm-01232103v1
On Quasiperiodic Morphisms Florence Levé,Gwenaël Richomme WORDS: Combinatorics on Words, Sep 2013, Turku, Finland. pp.181-192, ⟨10.1007/978-3-642-40579-2_20⟩ Communication dans un congrès hal-00816766v1
Some Examples and Counter-Examples About the S-Adic Conjecture Fabien Durand,Julien Leroy,Gwenaël Richomme Numération 2011, Jun 2011, Liège, Belgium Communication dans un congrès lirmm-00604422v1
Counting different palindromes in a word in linear time Richard Groult,Elise Prieur,Gwenaël Richomme Journées GdT COMATEGE du GDR IM, 2010, Montpellier, France Communication dans un congrès hal-00516721v1
On the fixed points of the iterated pseudopalindromic closure operator Geneviève Paquin,Gwenaël Richomme,Damien Jamet,Laurent Vuillon 2nd Canadian Discrete and Algorithmic Mathematics Conference - CanaDAM 2009, 2009, Montreal, Canada Communication dans un congrès hal-00391429v1
A local balance property of episturmian words Gwenaël Richomme Development in Language Theory (DLT'2007), Jul 2007, Turku, Finland. pp.371-381 Communication dans un congrès hal-00130229v2
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words Gwenaël Richomme 2005, pp.341-351 Communication dans un congrès hal-00013457v1
Computing the closure of sets of words under partial commutations Yves Métivier,Gwenaël Richomme,Pierre-André Wacrenier International Colloquium on Automata, Languages and Programming (ICALP), 1995, Hungary. pp.75-86 Communication dans un congrès hal-00307445v1
On the star operation and the finite power property in free partially commutative monoid Yves Métivier,Gwenaël Richomme Annual Symposium on Theoretical Aspects of Computer Science (STACS), 1994, France. pp.341-352 Communication dans un congrès hal-00307443v1

Ouvrages (1)

Special issue 13th &quot;Journées Montoises d'Informatique Théorique Fabien Durand,Gwenaël Richomme EDP Sciences, 46 (1), pp.1-200, 2012, RAIRO Theoretical Informatics and Applications, ⟨10.1051/ita/2012004⟩ Ouvrages lirmm-00799906v1

Pré-publication, Document de travail (1)

Towards a statement of the S-adic conjecture through examples Fabien Durand,Julien Leroy,Gwenaël Richomme 2012 Pré-publication, Document de travail hal-00724788v1

Rapport (2)

Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms Gwenaël Richomme,Patrice Séébold [Research Report] RR-10030, Lirmm. 2010 Rapport (rapport de recherche) lirmm-00512187v1
On Factorially Balanced Sets of Words Gwenaël Richomme,Patrice Séébold [Research Report] RR-10028, Lirmm. 2010 Rapport (rapport de recherche) lirmm-00507782v1