{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:19:12Z","timestamp":1743117552301,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"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_10","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"132-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Squareable Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Abraham","family":"Rashin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135\u2013141 (1999)","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press, Boca Raton (2008)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2012.03.034","volume":"443","author":"F Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Rashin, A., Willett, E.: Periodicity algorithms and a conjecture on overlaps in partial words. Theoretical Computer Science 443, 35\u201345 (2012)","journal-title":"Theoretical Computer Science"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.tcs.2008.11.006","volume":"410","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Scott, G.: A generalization of Thue freeness for partial words. Theoretical Computer Science 410, 793\u2013800 (2009)","journal-title":"Theoretical Computer Science"},{"unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) 7th SIAM-AMS Complexity of Computation, pp. 113\u2013125 (1974)","key":"10_CR5"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.tcs.2008.12.041","volume":"410","author":"V Halava","year":"2009","unstructured":"Halava, V., Harju, T., K\u00e4rki, T., S\u00e9\u00e9bold, P.: Overlap-freeness in infinite partial words. Theoretical Computer Science 410, 943\u2013948 (2009)","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2007.09.028","volume":"389","author":"F Manea","year":"2007","unstructured":"Manea, F., Merca\u015f, R.: Freeness of partial words. Theoretical Computer Science 389, 265\u2013277 (2007)","journal-title":"Theoretical Computer Science"},{"key":"10_CR8","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 7, 1\u201322 (1906). (Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, Norway (1977), pp. 139\u2013158)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"10_CR9","first-page":"1","volume":"1","author":"A Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 1, 1\u201367 (1912). (Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, Norway (1977), pp. 413\u2013478)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:34:15Z","timestamp":1675272855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}