15 citations · 40 across the 14 of their papers we have counts for
4 papers · 1 filter
On the Parikh-de-Bruijn grid
Péter Burcsi, Zsuzsanna Lipták, W. F. Smyth
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural in…
Lyndon Array Construction during Burrows-Wheeler Inversion
Felipe A. Louza, W. F. Smyth, Giovanni Manzini +1
In this paper we present an algorithm to compute the Lyndon array of a string of length as a byproduct of the inversion of the Burrows-Wheeler transform of . Our algorit…
More properties of the Fibonacci word on an infinite alphabet
Amy Glen, Jamie Simpson, W. F. Smyth
Recently the Fibonacci word on an infinite alphabet was introduced by [Zhang et al., Electronic J. Combinatorics 24-2 (2017) #P2.52] as a fixed point of the morphism $ϕ: (2i) \…
Counting Lyndon factors
Amy Glen, Jamie Simpson, W. F. Smyth
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length can contain. We also derive formulas for the expected total number of Lyndon fac…