Author:
Dudı́k Miroslav,Schulman Leonard J.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. J.P. Allouche, J. Shallit, The ubiquitous Prouhet–Thue–Morse sequence, in: Sequences and their Applications (Singapore, 1998), Springer Series in Discrete Mathematics and Theoretical Computer Science, Springer, London, 1999, pp. 1–16.
2. Littlewood-type problems on [0,1];Borwein;Proc. London Math. Soc. (3),1999
3. The Prouhet–Tarry–Escott problem revisited;Borwein;Enseign. Math. (2),1994
4. C. Choffrut, J. Karhumäki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. I, Springer, Berlin, 1997, pp. 329–438.
5. L.O. Kalashnik, The reconstruction of a word from fragments, Numerical Mathematics and Computer Technology, Akad. Nauk. Ukrain. SSR Inst. Mat., Preprint IV: 56–57, 1973.
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Subsequence frequency in binary words;Discrete Mathematics;2024-05
2. Counting subwords in circular words and their Parikh matrices;Theoretical Computer Science;2024-02
3. DNA sequences and DNA codes;Sequences and the de Bruijn Graph;2024
4. Generalized Unique Reconstruction From Substrings;IEEE Transactions on Information Theory;2023-09
5. Coding for Polymer-Based Data Storage;IEEE Transactions on Information Theory;2023-08