Abstract
Given an ordered alphabet, a Lyndon word is a primitive word which is minimum in its conjugation class for lexicographical ordering. We give an algorithm which gives the list in order of all Lyndon words of a given length. The algorithm is optimal in the sense that computing each new Lyndon word in the list is done in linear time and with no auxiliary memory. As an application, we give a construction of a section of conjugation classes of given length. It is an answer to a question raised to the author by M.P. Schützenberger.
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.
