{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:44:44Z","timestamp":1776822284997,"version":"3.51.2"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975479","type":"print"},{"value":"9783031975486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97548-6_8","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:48:52Z","timestamp":1751194132000},"page":"83-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Words Avoiding Half-Flips"],"prefix":"10.1007","author":[{"given":"James","family":"Currie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"8_CR1","unstructured":"Aberkane, A.,Currie, J.,Rampersad, N.: The number of ternary words avoiding abelian cubes grows exponentially. J. Integer Seq. 7 (2004). Article 04.2.7, 13 pp"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Ochem, P.: Avoiding conjugacy classes on the 5-letter alphabet. RAIRO ITA 54 (2020). Article no. 2","DOI":"10.1051\/ita\/2020003"},{"key":"8_CR3","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. Ph.D. thesis, Paris VI (1994)"},{"issue":"274","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"J Currie","year":"2011","unstructured":"Currie, J., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comput. 80(274), 1063\u20131070 (2011)","journal-title":"Math. Comput."},{"issue":"5","key":"8_CR5","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1016\/j.jcta.2012.01.006","volume":"119","author":"J Currie","year":"2012","unstructured":"Currie, J., Rampersad, N.: Fixed points avoiding Abelian k-powers. J. Combin. Theor. Ser. A 119(5), 942\u2013948 (2012)","journal-title":"J. Combin. Theor. Ser. A"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Combin. Theor. Ser. A 13, 90\u201399 (1972)","journal-title":"J. Combin. Theor. Ser. A"},{"key":"8_CR7","unstructured":"Fici, G.: Personal communication"},{"issue":"27","key":"8_CR8","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theoret. Comput. Sci. 412(27), 3010\u20133018 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"2381","DOI":"10.1137\/17M1149377","volume":"32","author":"M Rao","year":"2018","unstructured":"Rao, M., Rosenfeld, M.: Avoiding Two Consecutive Blocks of Same Size and Same Sum over $${\\mathbb{Z}}^2$$. SIAM J. Disc. Math. 32(4), 2381\u20132397 (2018)","journal-title":"SIAM J. Disc. Math."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut. Cambridge (2023)","DOI":"10.1017\/9781108775267"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97548-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:21:41Z","timestamp":1776820901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97548-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975479","9783031975486"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97548-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2025.loria.fr\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}