{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:53:28Z","timestamp":1725515608347},"publisher-location":"Boston, MA","reference-count":28,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096797"},{"type":"electronic","value":"9780387096803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09680-3_7","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T11:37:14Z","timestamp":1216640234000},"page":"101-114","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructing words from a fixed palindromic length sequence"],"prefix":"10.1007","author":[{"given":"Alexandre Blondin","family":"Mass\u00e9","sequence":"first","affiliation":[]},{"given":"Sre\u010dko","family":"Brlek","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Frosini","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Labb\u00e9","sequence":"additional","affiliation":[]},{"given":"Simone","family":"Rinaldi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Aberkane, A. and Brlek, S. (2002) Suites de m\u00eame complexit\u00e9 que celle de Thue-Morse, Actes des Journ\u00e9es Montoises d\u2019informatique th\u00e9orique (9-11 septembre 2002, Montpellier, France) 85\u201389."},{"key":"7_CR2","unstructured":"Aberkane, A., Brlek, S. and Glen, A. (2007) Sequences having the Thue-Morse complexity, Disc. Math. 15p. (submitted)"},{"key":"7_CR3","unstructured":"Allouche, J.-P. (1994) Sur la complexit\u00e9 des suites infinies, Bull. Belg. Math. Soc. 1:133\u2013143."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Allouche, J.P. (1997) Schr\u00f6dinger operators with Rudin-Shapiro potentials are not palindromic, J. Math. Phys. 38:1843\u20131848.","DOI":"10.1063\/1.531916"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"J.P.  Allouche","year":"2003","unstructured":"Allouche, J.P., Baake, M., Cassaigne, J., and Damanik, D. (2003) Palindrome complexity, Theoret. Comput. Sci. 292:9\u201331.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR6","first-page":"1","volume":"4","author":"J.P.  Allouche","year":"2000","unstructured":"Allouche, J.P., and Shallit, J. (2000) Sums of digits, overlaps, and palindromes, Disc. Math. and Theoret. Comput. Sci. 4:1\u201310.","journal-title":"Disc. Math. and Theoret. Comput. Sci."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1007678316583","volume":"49","author":"M. Baake","year":"1999","unstructured":"Baake, M. (1999) A note on palindromicity, Lett. Math. Phys. 49:217\u2013227.","journal-title":"Lett. Math. Phys."},{"key":"7_CR8","unstructured":"Blondin Mass\u00e9, A., Brlek, S., and Labb\u00e9, S. (2008) Palindromic lacunas of the Thue-Morse word, GASCOM 2008 (To appear)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Fici, G., Mignosi, F., Restivo, A. and Sciortino, M. (2006) Word assembly through minimal forbidden words,Theoret. Comput. Sci., 359\/1-3: 214\u2013230.","DOI":"10.1016\/j.tcs.2006.03.006"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)90274-E","volume":"24","author":"S. Brlek","year":"1989","unstructured":"Brlek, S. (1989) Enumeration of factors in the Thue-Morse word, Disc. Appl. Math. 24:83\u201396.","journal-title":"Disc. Appl. Math."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S012905410400242X","volume":"15\/2","author":"S. Brlek","year":"2004","unstructured":"Brlek, S., Hamel, S., Nivat, M., and Reutenauer, C. (2004) On the Palindromic Complexity of Infinite Words, in J. Berstel, J. Karhum\u00e4ki, D. Perrin, Eds, Combinatorics on Words with Applications, Int. J. of Found. of Comput. Sci., 15\/2:293\u2013306","journal-title":"Int. J. of Found. of Comput. Sci."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(02)00746-6","volume":"302","author":"S. Brlek","year":"2003","unstructured":"Brlek, S., and Ladouceur, A. (2003) A note on differentiable palindromes, Theoret. Comput. Sci. 302:167\u2013178.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR13","first-page":"16681","volume":"393\/1-3","author":"S. Brlek","year":"2008","unstructured":"Brlek, S., Jamet, D., and Paquin, G., (2008) Smooth Words on 2-letter alphabets having same parity, Theoret. Comput. Sci. 393\/1-3:16681.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.tcs.2005.12.003","volume":"352\/1-3","author":"S. Brlek","year":"2006","unstructured":"Brlek, S., Dulucq, S., Ladouceur, A. and Vuillon L. (2006) Combinatorial properties of smooth infinite words, Theoret. Comput. Sci. 352\/1-3:306\u2013317.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR15","first-page":"758764","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn N. G. (1946) A Combinatorial Problem, Koninklijke Nederlandse Akademie v. Wetenschappen 49:758764.","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X. Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., and Pirillo, G. (2001) Episturmian words and some constructions of de Luca and Rauzy, Theoret. Comput. Sci. 255:539\u2013553.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR17","first-page":"10710","volume":"1","author":"C. Flye Sainte-Marie","year":"1894","unstructured":"Flye Sainte-Marie, C. (1894). Question 48, L\u2019Interm\u017ddiaire Math. 1: 10710.","journal-title":"L\u2019Interm\u017ddiaire Math."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90069-9","volume":"23\/3","author":"H. Fredericksen","year":"1978","unstructured":"Fredericksen, H. and Maiorana, J. (1978) Necklaces of beads in k colors and k-ary de Bruijn sequences Disc. Math. 23\/3, 207\u2013210","journal-title":"Disc. Math."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1112\/jlms\/s1-21.3.167","volume":"21","author":"I.J. Good","year":"1946","unstructured":"Good, I. J. (1946) Normal recurring decimals, J. London Math. Soc. 21 (3): 167\u2013169.","journal-title":"J. London Math. Soc."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02099468","volume":"174","author":"A. Hof","year":"1995","unstructured":"Hof, A., Knill, O., and Simon, B. (1995) Singular continuous spectrum for palindromic Schr\u00f6dinger operators, Commun. Math. Phys. 174:149\u2013159.","journal-title":"Commun. Math. Phys."},{"key":"7_CR21","unstructured":"Lothaire M. (1983) Combinatorics on words, Addison-Wesley."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Lothaire, M. (2002) Algebraic Combinatorics on words, Cambridge University Press.","DOI":"10.1017\/CBO9781107326019"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","volume":"183","author":"A. Luca de","year":"1997","unstructured":"de Luca, A. (1997) Sturmian words: structure, combinatorics, and their arithmetics, Theoret. Comput. Sci. 183:45\u201382.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(89)90013-3","volume":"63","author":"A Luca de","year":"1989","unstructured":"de Luca, A. , and Varricchio, S. (1989) Some combinatorial properties of the Thue-Morse sequence, Theoret. Comput. Sci. 63:333\u2013348.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-9078-6","volume":"42\/3","author":"S. Mantaci","year":"2008","unstructured":"Mantaci, S., Restivo, A., Rosone, G. and Sciortino, M. (2008) A New Combinatorial Approach to Sequence Comparison Theory Comput. Syst. 42\/3:411\u2013429.","journal-title":"Theory Comput. Syst."},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(91)90026-X","volume":"94\/3","author":"B. Manvel","year":"1991","unstructured":"Manvel, B., Meyerowitz, A., Schwenk\u2606, A., Smith, K. and Stockmeyer, P. (1991) Reconstruction of sequences, Disc. Math. 94\/3: 209\u2013219.","journal-title":"Disc. Math."},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90172-X","volume":"82\/1","author":"F. Mignosi","year":"1991","unstructured":"Mignosi, F. (1991) On the number of factors of Sturmian words, Theoret. Comput. Sci. 82\/1: 71\u201384.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"M. Morse","year":"1940","unstructured":"Morse, M. and Hedlund, G. (1940) Symbolic Dynamics II. Sturmian trajectories, Amer. J. Math. 62:1\u201342.","journal-title":"Amer. J. Math."}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:44:40Z","timestamp":1619574280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096797","9780387096803"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_7","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}