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
Publications
|
|
On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair wordsTheoretical Computer Science, 2025, 1066, pp.115732. ⟨10.1016/j.tcs.2025.115732⟩ |
|
|
On sets of indefinitely desubstitutable wordsTheoretical Computer Science, 2021, 857, pp.97-113. ⟨10.1016/j.tcs.2021.01.004⟩ |
|
|
Coverability and multi-scale coverability on infinite picturesJournal of Computer and System Sciences, 2019, 104, pp.258-277. ⟨10.1016/j.jcss.2017.05.001⟩ |
|
|
Characterization of infinite LSP words and endomorphisms preserving the LSP propertyInternational Journal of Foundations of Computer Science, 2019, 30 (1), pp.171-196. ⟨10.1142/S0129054119400082⟩ |
|
|
Avoidability of circular formulasTheoretical Computer Science, 2018, 726, pp.1-4. ⟨10.1016/j.tcs.2017.11.014⟩ |
|
|
Greedy Palindromic LengthsInternational Journal of Foundations of Computer Science, 2018, 29 (03), pp.331- 356. ⟨10.1142/S0129054118500077⟩ |
|
|
Periodicity in rectangular arraysInformation Processing Letters, 2017, 118, pp.58-63. ⟨10.1016/j.ipl.2016.09.011⟩ |
|
|
Minimal critical exponent of quasiperiodic wordsTheoretical Computer Science, 2014, 548, pp.117-122. ⟨10.1016/j.tcs.2014.06.039⟩ |
|
|
A Combinatorial Proof of S-adicity for Sequences with Linear ComplexityIntegers : Electronic Journal of Combinatorial Number Theory, 2013, 13, pp.article #A5. ⟨10.1515/9783110298161.50⟩ |
|
|
Do the Properties of an S-adic Representation Determine Factor Complexity?Journal of Integer Sequences, 2013, 16 (2), pp.Art 13.2.6 |
|
|
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphismsTheoretical Computer Science, 2012, 428, pp.92-97. ⟨10.1016/j.tcs.2011.12.008⟩ |
|
|
On the fixed points of the iterated pseudopalindromic closure operatorTheoretical Computer Science, 2011, 412 (27), pp.2974-2987. ⟨10.1016/j.tcs.2010.03.018⟩ |
|
|
Avoiding Abelian Powers in Binary Words with Bounded Abelian ComplexityInternational Journal of Foundations of Computer Science, 2011, 22 (4), pp.905-920. ⟨10.1142/S0129054111008489⟩ |
|
|
Abelian Complexity of Minimal subshiftsJournal of the London Mathematical Society, 2011, 83 (1), pp.79-95. ⟨10.1112/jlms/jdq063⟩ |
On Factorially Balanced Sets of WordsTheoretical Computer Science, 2011, 412 (39), pp.5492-5497. ⟨10.1016/j.tcs.2011.06.027⟩ |
|
|
|
Balance and Abelian Complexity of the Tribonacci wordAdvances in Applied Mathematics, 2010, 45 (2), pp.212-231. ⟨10.1016/j.aam.2010.01.006⟩ |
Optimality of some algorithms to detect quasiperiodicitiesTheoretical Computer Science, 2010, 411 (34-36), pp.3110-3122. ⟨10.1016/j.tcs.2010.04.039⟩ |
|
|
|
Standard Factors of Sturmian WordsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2010, 44 (1), pp.159-174. ⟨10.1051/ita/2010011⟩ |
Counting distinct palindromes in a word in linear timeInformation Processing Letters, 2010, 110, pp.908-912. ⟨10.1016/j.ipl.2010.07.018⟩ |
|
|
|
Directive words of episturmian words: equivalences and normalizationRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2009, 43 (2), pp.299-319. ⟨10.1051/ita:2008029⟩ |
Quasiperiodic and Lyndon episturmian wordsTheoretical Computer Science, 2008, 409 (3), pp.578-600 |
|
|
|
Well quasi-orders and the shuffle closure of finite setsTheoretical Computer Science, 2007, 377, pp.73-92 |
|
|
Sudo-LyndonBulletin- European Association for Theoretical Computer Science, 2007, 92, pp.143-149 |
|
|
Quasiperiodic Sturmian words and morphismsTheoretical Computer Science, 2007, 372 (1), pp.15-25 |
|
|
On morphisms preserving infinite Lyndon wordsDiscrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.89-108. ⟨10.46298/dmtcs.411⟩ |
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian wordsTheoretical Computer Science, 2007, 380, pp.393-400 |
|
|
|
Existence of finite test-sets for k-power-freeness of uniform morphismsDiscrete Applied Mathematics, 2007, 155 (15), pp.2001-2016 |
On a conjecture about finite fixed points of morphismsTheoretical Computer Science, 2005, 339, pp.103-128 |
|
Some characterizations of Parikh matrix equivalent binary wordsInformation Processing Letters, 2004, 92 (2), pp.77-82 |
|
Overlap-free morphisms and finite test-setsDiscrete Applied Mathematics, 2004, 143 (1-3), pp.92-109 |
|
Conjectures and results on morphisms generating k-power-free wordsInternational Journal of Foundations of Computer Science, 2004, 15 (2), pp.307-316 |
|
Quasiperiodic infinite words: some answersBulletin- European Association for Theoretical Computer Science, 2004, 84, pp.128-138 |
|
Some algorithms to compute the conjugates of episturmian morphismsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2003, 37, pp.85-104 |
|
Conjugacy and episturmian morphismsTheoretical Computer Science, 2003, 302, pp.1-34 |
|
Lyndon morphismsBulletin of the Belgian Mathematical Society - Simon Stevin, 2003, 10 (5), pp.761-785 |
|
Some non finitely generated monoids of repetition-free endomorphismsInformation Processing Letters, 2003, 85 (2), pp.61-66 |
|
Some results on k-power-free morphismsTheoretical Computer Science, 2002, 273, pp.119-142 |
|
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace MonoidsTheory of Computing Systems, 2001, 34, pp.193-217. ⟨10.1007/s00224-001-0006-x⟩ |
|
Characterization of test-sets for overlap-free morphismsDiscrete Applied Mathematics, 1999, 98, pp.151-157. ⟨10.1016/S0166-218X(99)00118-3⟩ |
|
Another characterization of Sturmian words (one more)Bulletin- European Association for Theoretical Computer Science, 1999, 67, pp.173-175 |
|
Test-words for Sturmian morphismsBulletin of the Belgian Mathematical Society - Simon Stevin, 1999, 6 (4), pp.481-489 |
|
New results on the star problem in trace monoidsInformation and Computation, 1995, 119, pp.240-251 |
|
|
Reconstructing words using queries on subwords or factorsSTACS 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⟩ |
|
|
A characterization of binary morphisms generating Lyndon infinite wordsWORDS 2021 - 13th International Conference on Combinatorics on Words, Sep 2021, Rouen, France. pp.160-171, ⟨10.1007/978-3-030-85088-3_14⟩ |
|
|
On Families of Limit S-adic WordsWORDS 2019 - 12th International Conference on Combinatorics on Words, Sep 2019, Loughborough, United Kingdom. pp.9-11, ⟨10.1007/978-3-030-28796-2⟩ |
|
|
A Characterization of Infinite LSP WordsDLT: Developments in Language Theory, Aug 2017, Liège, Belgium. pp.320-331, ⟨10.1007/978-3-319-62809-7_24⟩ |
|
|
Determining Sets of Quasiperiods of Infinite WordsMFCS: Mathematical Foundations of Computer Science, Aug 2016, Cracovie, Poland. pp.40:1-40:13, ⟨10.4230/LIPIcs.MFCS.2016.40⟩ |
|
|
Coverability in Two Dimensions9th 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⟩ |
|
|
Left greedy palindromic lengthJournées Montoises d'Informatique Théorique, Sep 2014, Nancy, France |
|
|
On Quasiperiodic MorphismsWORDS: Combinatorics on Words, Sep 2013, Turku, Finland. pp.181-192, ⟨10.1007/978-3-642-40579-2_20⟩ |
Some Examples and Counter-Examples About the S-Adic ConjectureNumération 2011, Jun 2011, Liège, Belgium |
|
Counting different palindromes in a word in linear timeJournées GdT COMATEGE du GDR IM, 2010, Montpellier, France |
|
On the fixed points of the iterated pseudopalindromic closure operator2nd Canadian Discrete and Algorithmic Mathematics Conference - CanaDAM 2009, 2009, Montreal, Canada |
|
|
|
A local balance property of episturmian wordsDevelopment in Language Theory (DLT'2007), Jul 2007, Turku, Finland. pp.371-381 |
|
|
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words2005, pp.341-351 |
Computing the closure of sets of words under partial commutationsInternational Colloquium on Automata, Languages and Programming (ICALP), 1995, Hungary. pp.75-86 |
|
On the star operation and the finite power property in free partially commutative monoidAnnual Symposium on Theoretical Aspects of Computer Science (STACS), 1994, France. pp.341-352 |
|
|
Special issue 13th "Journées Montoises d'Informatique ThéoriqueEDP Sciences, 46 (1), pp.1-200, 2012, RAIRO Theoretical Informatics and Applications, ⟨10.1051/ita/2012004⟩ |
|
|
Towards a statement of the S-adic conjecture through examples2012 |
|
|
Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms[Research Report] RR-10030, Lirmm. 2010 |
|
|
On Factorially Balanced Sets of Words[Research Report] RR-10028, Lirmm. 2010 |