The following pages link to Gwenaël Richomme (Q344539):
Displaying 45 items.
- Periodicity in rectangular arrays (Q344541) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms (Q418752) (← links)
- (Q719289) (redirect page) (← links)
- On factorially balanced sets of words (Q719290) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Balance and abelian complexity of the Tribonacci word (Q984024) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- (Q1605330) (redirect page) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- Avoidability of circular formulas (Q1743715) (← links)
- Overlap-free morphisms and finite test-sets (Q1887045) (← links)
- New results on the star problem in trace monoids (Q1893738) (← links)
- Characterization of test-sets for overlap-free morphisms (Q1961240) (← links)
- A characterization of binary morphisms generating Lyndon infinite words (Q2140469) (← links)
- On sets of indefinitely desubstitutable words (Q2220783) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820) (← links)
- A characterization of infinite LSP words (Q2408812) (← links)
- Coverability and multi-scale coverability on infinite pictures (Q2424689) (← links)
- Coverability in Two Dimensions (Q2799191) (← links)
- On Quasiperiodic Morphisms (Q2849988) (← links)
- (Q2855577) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS (Q3022000) (← links)
- Abelian complexity of minimal subshifts (Q3074533) (← links)
- (Q3396619) (← links)
- Well Quasi Orders and the Shuffle Closure of Finite Sets (Q3617063) (← links)
- Directive words of episturmian words: equivalences and normalization (Q3625695) (← links)
- (Q4267180) (← links)
- (Q4453456) (← links)
- Some algorithms to compute the conjugates of Episturmian morphisms (Q4462680) (← links)
- (Q4501525) (← links)
- Determining Sets of Quasiperiods of Infinite Words (Q4608601) (← links)
- Greedy Palindromic Lengths (Q4640335) (← links)
- Computing the closure of sets of words under partial commutations (Q4645168) (← links)
- (Q4708607) (← links)
- Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable (Q5096916) (← links)
- Standard factors of Sturmian words (Q5190084) (← links)
- Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property (Q5384436) (← links)
- (Q5387714) (← links)
- (Q5404286) (← links)
- A Local Balance Property of Episturmian Words (Q5428248) (← links)
- Reconstructing words using queries on subwords or factors (Q6615163) (← links)
