Abstract
In this paper we study the privileged complexity function of the Thue–Morse word. We prove a recursive formula describing this function, and using the formula we show that the function is unbounded and that the values of the function have arbitrarily large gaps of zeros. This demonstrates that the privileged complexity function of an infinite word can drastically differ from its palindromic complexity function, even though there are relations between these functions. Further we study the behavior of palindromes and privileged words in infinite words and the relation between rich words and privileged words.
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.
