Abstract
A non-empty word ω of {a, b}* is a Lyndon word if and only if it is strictly smaller for the lexicographical order than any of its proper suffixes. Such a word ω is either a letter or admits a standard factorization uv where v is its smallest proper suffix. For any Lyndon word v, we show that the set of Lyndon words having v as right factor of the standard factorization is rational and compute explicitly the associated generating function. Next we establish that, for the uniform distribution over the Lyndon words of length n, the average length of the right factor v of the standard factorization is asymptotically equivalent to 3n/4. Finally we present algorithms on Lyndon words derived from our work together with experimental results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
