Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Richomme, Gwenaël"'
Autor:
Richomme, Gwenaël, Rosenfeld, Matthieu
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 $w$ of length $n$ over an alphabet of cardinality $k$, $w$ can be reconstructed fr
Externí odkaz:
http://arxiv.org/abs/2301.01571
Autor:
Richomme, Gwenaël, Séébold, Patrice
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 finite Lyndon words as prefixes. A characterization of binary endomorphisms
Externí odkaz:
http://arxiv.org/abs/2105.01327
Autor:
Richomme, Gwenaël
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 notion generalizes the notion of sets of fixed points of morphisms. It
Externí odkaz:
http://arxiv.org/abs/2011.07838
Autor:
Richomme, Gwenaël
Answering a question of G. Fici, we give an $S$-adic characterization of thefamily of infinite LSP words, that is, the family of infinite words having all their left special factors as prefixes.More precisely we provide a finite set of morphisms $S$
Externí odkaz:
http://arxiv.org/abs/1808.02680
Autor:
Richomme, Gwenaël
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 this latter property. We characterize here infinite LSP words in terms
Externí odkaz:
http://arxiv.org/abs/1705.05786
Clark has defined the notion of $n$-avoidance basis which contains the avoidable formulas with at most $n$ variables that are closest to be unavoidable in some sense. The family $C_i$ of circular formulas is such that $C_1=AA$, $C_2=ABA.BAB$, $C_3=AB
Externí odkaz:
http://arxiv.org/abs/1610.04439
Autor:
Bucci, Michelangelo, Richomme, Gwenaël
In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We int
Externí odkaz:
http://arxiv.org/abs/1606.05660
We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We count the numb
Externí odkaz:
http://arxiv.org/abs/1602.06915
Autor:
Gamard, Guilhem, Richomme, Gwenaël
A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods. These notion
Externí odkaz:
http://arxiv.org/abs/1506.08375
Autor:
Levé, Florence, Richomme, Gwénaël
Publikováno v:
9th International Conference, WORDS 2013, Turku : Finlande (2013)
Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite words, we g
Externí odkaz:
http://arxiv.org/abs/1304.6280