Reconstruction from subsequences

Journal of Combinatorial Theory. Series A

Volumn 103, Issue 2, 2003, Pages 337-348

  Dudík, Miroslav ^a   Schulman, Leonard J ^b  

^a PRINCETON UNIVERSITY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042853681     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-3165(03)00103-1     Document Type: Article

References (8)

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. P. Borwein, T. Erdélyi, G. Kós, Littlewood-type problems on [0, 1], Proc. London Math. Soc. (3) 79 (1) (1999) 22-46.
3. P. Borwein, C. Ingalls, The Prouhet-Tarry-Escott problem revisited, Enseign. Math. (2) 40 (1-2) (1994) 3-27.
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.
6. I. Krasikov, Y. Roditty, On a reconstruction problem for sequences, J. Combin. Theory Ser. A 77 (2) (1997) 344-348.
7. J. Maňuch, Characterization of a word by its subwords, in: G. Rozenberg, W. Thomas (Eds.), Developments in Language Theory: Foundations, Applications, and Perspectives, Proceedings of the Fourth International Conference, World Scientific, Singapore, 2000, pp. 210-219.
8. B. Manvel, A. Meyerowitz, A. Schwenk, K. Smith, P. Stockmeyer, Reconstruction of sequences, Discrete Math. 94 (1991) 209-219.