12 citations · 16 across the 8 of their papers we have counts for
4 papers · 1 filter
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre +2
Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if…
Fast Computation of Abelian Runs
Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq +2
Given a word and a Parikh vector , an abelian run of period in is a maximal occurrence of a substring of having abelian period .…
Abelian Powers and Repetitions in Sturmian Words
Gabriele Fici, Alessio Langiu, Thierry Lecroq +4
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent for every . We imp…
Online Computation of Abelian Runs
Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre +1
Given a word and a Parikh vector , an abelian run of period in is a maximal occurrence of a substring of having abelian period .…