67 citations · 145 across the 21 of their papers we have counts for
24 papers
On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
Gwenaël Richomme
The binomial notation (w u) represents the number of occurrences of the word u as a (scattered) subword in w. We first introduce and study possible uses of a geometrical interpreta…
Reconstructing words using queries on subwords or factors
Gwenaël Richomme, Matthieu Rosenfeld
We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word of lengt…
A characterization of binary morphisms generating Lyndon infinite words
Gwenaël Richomme, Patrice Séébold
An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finit…
On sets of indefinitely desubstitutable words
Gwenaël Richomme
The stable set associated to a given set S of nonerasing endomorphisms or substitutions is the set of all right infinite words that can be indefinitely desubstituted over S. This n…
Characterization of infinite LSP words and endomorphisms preserving the LSP property
Gwenaël Richomme
Answering a question of G. Fici, we give an -adic characterization of thefamily of infinite LSP words, that is, the family of infinite words having all their left special factor…
A Characterization of Infinite LSP Words
Gwenaël Richomme
G. Fici proved that a finite word has a minimal suffix automaton if and only if all its left special factors occur as prefixes. He called LSP all finite and infinite words having t…