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.
Similar content being viewed by others
References
Lothaire, M., Combinatorics on Words, Reading, Addison-Wesley, 1983.
Leont’ev, V.K., Problems of Reconstructing Words from Their Fragments and Applications, Diskr. Analiz Issled. Operatsii, Ser. 1, 1995, vol. 2, no. 2, pp. 26–48 [Oper. Res. Discr. Analysis (Engl. Transl.), Korshunov, A.D., Ed., Mathematics and Its Applications, vol. 391, 1997, pp. 123–144].
Levenshtein, V.I., Elements of Coding Theory. in Diskretnaya matematika i matematicheskie voprosy kibernetiki (Discrete Mathematics and Mathematical Problems of Cybernetics), Moscow: Nauka, 1974, pp. 207–305.
Leont’ev, V.K., On Spectra of Binary Words, in Metody kombinatornoi optimizatsii (Methods of Combinatorial Optimization), Moscow: Computing Center RAS, 1997, pp. 37–46.
Author information
Authors and Affiliations
Additional information
Original Russian Text © V.K. Leont’ev, S.A. Mukhina, 2006, published in Problemy Peredachi Informatsii, 2006, Vol. 42, No. 3, pp. 73–77.
Supported in part by the Russian Foundation for Basic Research, project no. 04-01-00814.
Rights and permissions
About this article
Cite this article
Leont’ev, V.K., Mukhina, S.A. On fragments of words. Probl Inf Transm 42, 230–233 (2006). https://doi.org/10.1134/S0032946006030069
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0032946006030069