Reconstructing a string from its Lyndon arrays

Given a string x=x[1..n] on an ordered alphabet Σ of size σ, the Lyndon array λ=λx[1..n] of x is an array of positive integers such that λ[i],1≤i≤n, is the length of the maximal Lyndon word over the ordering of Σ that begins at position i in x. The Lyndon array has recently attracted considerable attention due to its pivotal role in establishing the long-standing conjecture that ρ(n)