Abstract
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P ( n ) + P ( n + 1 ) = C ( n + 1 ) − C ( n ) + 2 for all n, where P (resp. C ) denotes the palindromic complexity (resp. factor complexity) function of w, which counts the number of distinct palindromic factors (resp. factors) of each length in w.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.