Abstract
A method to represent certain words on a binary alphabet by shorter words on a larger alphabet is introduced. We prove that overlap-free words are represented by the words of a rational language. Several consequences are derived concerning the density function of the set of overlap-free words on a binary alphabet and the prolongability of overlap-free words. In particular, efficient algorithms are obtained computing the density function of the set of overlap-free words on a binary alphabet, testing whether a word on a binary alphabet is overlap-free and computing its depth.
Sign-in/Register to access full text options 
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.
