Abstract
Let A be a finite non-empty set and ⪯ a total order on AN verifying the following lexicographic like condition: For each n∈N and u,v∈An, if uω≺vω then ux≺vy for all x,y∈AN. A word x∈AN is called ω-Lyndon if x≺y for each proper suffix y of x. A finite word w∈A+ is called ω-Lyndon if wω≺vω for each proper suffix v of w. In this note we prove that every infinite word may be written uniquely as a non-increasing product of ω-Lyndon words.
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.
