Abstract
Abstract Let y = y(0)y(1)y(2) … be an infinite word over a finite alphabet, and let py(r) count the number of distinct subwords of y of length r. In this paper we determine py(r) when y(i) = s2(i) mod k, where s2(i) denotes the sum of the base-2 digits of i. Our method is based on determining the redundancy of a certain code for subwords of a related infinite word.
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.
