Abstract
We find a precise value of the function F N(m, n, k), which is the number of binary words of length N and weight m that contain an arbitrary word of length n and weight k as a fragment. As a consequence, we obtain a known result on the number of binary words of length N that contain a fixed word of length n as a fragment.
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.
