Gwenaël Richomme

From MaRDI portal
Revision as of 11:19, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Gwenaël Richomme to Gwenaël Richomme: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:344539

Available identifiers

zbMath Open richomme.gwenaelMaRDI QIDQ344539

List of research outcomes





PublicationDate of PublicationType
Reconstructing words using queries on subwords or factors2024-10-08Paper
Reconstructing words using queries on subwords or factors2023-01-04Paper
Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable2022-08-18Paper
A characterization of binary morphisms generating Lyndon infinite words2022-05-20Paper
On sets of indefinitely desubstitutable words2021-01-25Paper
Coverability and multi-scale coverability on infinite pictures2019-06-25Paper
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property2019-06-24Paper
Computing the closure of sets of words under partial commutations2019-01-10Paper
Greedy Palindromic Lengths2018-05-17Paper
Avoidability of circular formulas2018-04-16Paper
Determining Sets of Quasiperiods of Infinite Words2018-03-21Paper
A characterization of infinite LSP words2017-10-13Paper
Periodicity in rectangular arrays2016-11-23Paper
Coverability in Two Dimensions2016-04-08Paper
Minimal critical exponent of quasiperiodic words2014-08-27Paper
https://portal.mardi4nfdi.de/entity/Q54042862014-03-24Paper
https://portal.mardi4nfdi.de/entity/Q28555772013-10-25Paper
On Quasiperiodic Morphisms2013-09-20Paper
Towards a statement of the S-adic conjecture through examples2012-08-31Paper
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms2012-05-30Paper
Counting distinct palindromes in a word in linear time2012-03-27Paper
On factorially balanced sets of words2011-10-10Paper
AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY2011-07-14Paper
Abelian complexity of minimal subshifts2011-02-09Paper
Optimality of some algorithms to detect quasiperiodicities2010-08-11Paper
Balance and abelian complexity of the Tribonacci word2010-07-13Paper
Standard factors of Sturmian words2010-03-12Paper
https://portal.mardi4nfdi.de/entity/Q33966192009-09-19Paper
Directive words of episturmian words: equivalences and normalization2009-05-06Paper
Abelian Properties of Words (Extended abstract)2009-04-19Paper
Well Quasi Orders and the Shuffle Closure of Finite Sets2009-03-26Paper
Quasiperiodic and Lyndon episturmian words2009-01-08Paper
https://portal.mardi4nfdi.de/entity/Q53877142008-05-27Paper
A Local Balance Property of Episturmian Words2007-11-28Paper
Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms2007-09-19Paper
Well quasi-orders generated by a word-shuffle rewriting2007-06-06Paper
CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS2005-06-22Paper
Overlap-free morphisms and finite test-sets2004-11-23Paper
Some algorithms to compute the conjugates of Episturmian morphisms2004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44534562004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q47086072003-06-18Paper
Some results on \(k\)-power-free morphisms2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45015252001-05-03Paper
Characterization of test-sets for overlap-free morphisms2000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q42671801999-09-22Paper
New results on the star problem in trace monoids1995-08-02Paper

Research outcomes over time

This page was built for person: Gwenaël Richomme