2 citations · 3 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2015★ 1 cited
On prefixal factorizations of words
Aldo de Luca, Luca Q. Zamboni
We consider the class of all infinite words over a finite alphabet admitting a prefixal factorization, i.e., a factorization whe…
math.CO2012
Clustering words
Sébastien Ferenczi, Luca Q. Zamboni
We characterize words which cluster under the Burrows-Wheeler transform as those words such that occurs in a trajectory of an interval exchange transformation, and build e…
math.CO2010★ 2 cited
Avoiding Abelian powers in binary words with bounded Abelian complexity
Julien Cassaigne, Gwénaël Richomme, Kalle Saari +1
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waer…