7 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.DM2021
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…
cs.DM2016★ 2 cited
Avoidability of circular formulas
Guilhem Gamard, Pascal Ochem, Gwenaël Richomme +1
Clark has defined the notion of -avoidance basis which contains the avoidable formulas with at most variables that are closest to be unavoidable in some sense. The family $C…
math.CO2002★ 7 cited
The Peano curve and counting occurrences of some patterns
S. Kitaev, T. Mansour
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in the…