{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:48:17Z","timestamp":1768585697204,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319214993","type":"print"},{"value":"9783319215006","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_12","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"155-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Palindromic Complexity of Trees"],"prefix":"10.1007","author":[{"given":"Sre\u010dko","family":"Brlek","sequence":"first","affiliation":[]},{"given":"Nadia","family":"Lafreni\u00e8re","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Proven\u00e7al","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoretical Computer Science 292(1), 9\u201331 (2003)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2012.12.024","volume":"475","author":"L Balkov\u00e1","year":"2013","unstructured":"Balkov\u00e1, L., Pelantov\u00e1, E., Starosta, S.: Proof of the Brlek-Reutenauer conjecture. Theoretical Computer Science 475, 120\u2013125 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"12_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(00)00039-X","volume":"223","author":"V Berth\u00e9","year":"2000","unstructured":"Berth\u00e9, V., Vuillon, L.: Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences. Discrete Mathematics 223(1\u20133), 27\u201353 (2000)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S012905410400242X","volume":"15","author":"S Brlek","year":"2004","unstructured":"Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. International Journal on Foundation of Computer Science 15(2), 293\u2013306 (2004)","journal-title":"International Journal on Foundation of Computer Science"},{"issue":"4\u20135","key":"12_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.tcs.2010.11.025","volume":"412","author":"S Brlek","year":"2011","unstructured":"Brlek, S., Reutenauer, C.: Complexity and palindromic defect of infinite words. Theoretical Computer Science 412(4\u20135), 493\u2013497 (2011)","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-31265-6_3","volume-title":"Combinatorial Pattern Matching","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Tyczy\u0144ski, W., Wale\u0144, T.: The maximum number of squares in a tree. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 27\u201340. Springer, Heidelberg (2012)"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","volume":"183","author":"A de Luca","year":"1997","unstructured":"de Luca, A.: Sturmian words: Structure, combinatorics, and their arithmetics. Theoretical Computer Science 183(1), 45\u201382 (1997)","journal-title":"Theoretical Computer Science"},{"key":"12_CR8","unstructured":"Domenjoud, E., Proven\u00e7al, X., Vuillon, L.: Palindromic language of thin discrete planes (to appear)"},{"issue":"2","key":"12_CR9","first-page":"109","volume":"7","author":"E Domenjoud","year":"2012","unstructured":"Domenjoud, E., Vuillon, L.: Geometric palindromic closure. Uniform Distribution Theory 7(2), 109\u2013140 (2012)","journal-title":"Uniform Distribution Theory"},{"issue":"1\u20132","key":"12_CR10","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., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoretical Computer Science 255(1\u20132), 539\u2013553 (2001)","journal-title":"Theoretical Computer Science"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1112\/jlms\/s1-16.4.212","volume":"16","author":"P Erd\u00f6s","year":"1941","unstructured":"Erd\u00f6s, P., Tur\u00e1n, P.: On a problem of Sidon in additive number theory, and on some related problems. Journal of the London Mathematical Society. Second Series 16, 212\u2013215 (1941)","journal-title":"Journal of the London Mathematical Society. Second Series"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Combin. Theory Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1051\/ita\/2009003","volume":"43","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J.: Episturmian words: a survey. Theoretical Informatics and Applications. Informatique Th\u00e9orique et Applications 43(3), 403\u2013442 (2009)","journal-title":"Theoretical Informatics and Applications. Informatique Th\u00e9orique et Applications"},{"key":"12_CR14","unstructured":"Gowers, T.: What are dense Sidon subsets of $$\\{1,2, \\ldots , n\\}$$ like? (2012). gowers.wordpress.com\/2012\/07\/13\/what-are-dense-sidon-subsets-of-12-n-like\/"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02099468","volume":"174","author":"A Hof","year":"1995","unstructured":"Hof, A., Knill, O., Simon, B.: Singular continuous spectrum for palindromic Schr\u00f6dinger operators. Comm. in Mathematical Physics 174(1), 149\u2013159 (1995)","journal-title":"Comm. in Mathematical Physics"},{"key":"12_CR16","unstructured":"Labb\u00e9, S., Reutenauer, C.: A $$d$$-dimensional extension of Christoffel words. Discrete & Computational Geometry (2015). http:\/\/arxiv.org\/abs\/1404.4021"},{"key":"12_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:49:51Z","timestamp":1676972991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}