{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:56:08Z","timestamp":1743098168860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"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-23660-5_19","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Tree of Ternary Square-Free Words"],"prefix":"10.1007","author":[{"given":"Elena A.","family":"Petrova","sequence":"first","affiliation":[]},{"given":"Arseny M.","family":"Shur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"DA Bean","year":"1979","unstructured":"Bean, D.A., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pac. J. Math. 85, 261\u2013294 (1979)","journal-title":"Pac. J. Math."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0195-6698(95)90051-9","volume":"16","author":"JD Currie","year":"1995","unstructured":"Currie, J.D.: On the structure and extendibility of $$k$$-power free words. Eur. J. Comb. 16, 111\u2013124 (1995)","journal-title":"Eur. J. Comb."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00493-003-0034-z","volume":"23","author":"JD Currie","year":"2003","unstructured":"Currie, J.D., Pierce, C.W.: The fixing block method in combinatorics on words. Combinatorica 23, 571\u2013584 (2003)","journal-title":"Combinatorica"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0195-6698(03)00044-1","volume":"24","author":"JD Currie","year":"2003","unstructured":"Currie, J.D., Shelton, R.O.: The set of $$k$$-power free words over $$\\sigma $$ is empty or perfect. Eur. J. Comb. 24, 573\u2013580 (2003)","journal-title":"Eur. J. Comb."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(84)90006-4","volume":"7","author":"JJ Pansiot","year":"1984","unstructured":"Pansiot, J.J.: A propos d\u2019une conjecture de F. Dejean sur les r\u00e9p\u00e9titions dans les mots. Discrete Appl. Math. 7, 297\u2013311 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1142\/S0129054112400643","volume":"23","author":"EA Petrova","year":"2012","unstructured":"Petrova, E.A., Shur, A.M.: Constructing premaximal binary cube-free words of any level. Int. J. Found. Comp. Sci. 23(8), 1595\u20131609 (2012)","journal-title":"Int. J. Found. Comp. Sci."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-642-32589-2_65","volume-title":"Mathematical Foundations of Computer Science 2012","author":"EA Petrova","year":"2012","unstructured":"Petrova, E.A., Shur, A.M.: Constructing premaximal ternary square-free words of any level. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 752\u2013763. Springer, Heidelberg (2012)"},{"key":"19_CR8","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-82456-2_20","volume-title":"Combinatorial Algorithms on Words","author":"A Restivo","year":"1985","unstructured":"Restivo, A., Salemi, S.: Some decision results on non-repetitive words. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series, vol. 12, pp. 289\u2013295. Springer, Heidelberg (1985)"},{"key":"19_CR9","first-page":"1","volume":"327","author":"R Shelton","year":"1981","unstructured":"Shelton, R.: Aperiodic words on three symbols. II. J. Reine Angew. Math. 327, 1\u201311 (1981)","journal-title":"II. J. Reine Angew. Math."},{"key":"19_CR10","first-page":"44","volume":"330","author":"RO Shelton","year":"1982","unstructured":"Shelton, R.O., Soni, R.P.: Aperiodic words on three symbols. III. J. Reine Angew. Math. 330, 44\u201352 (1982)","journal-title":"III. J. Reine Angew. Math."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"R140","DOI":"10.37236\/412","volume":"17","author":"AM Shur","year":"2010","unstructured":"Shur, A.M.: On ternary square-free circular words. Electron. J. Comb. 17, R140 (2010)","journal-title":"Electron. J. Comb."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00233-012-9382-6","volume":"84","author":"AM Shur","year":"2012","unstructured":"Shur, A.M.: Deciding context equivalence of binary overlap-free words in linear time. Semigroup Forum 84, 447\u2013471 (2012)","journal-title":"Semigroup Forum"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cosrev.2012.09.001","volume":"6","author":"AM Shur","year":"2012","unstructured":"Shur, A.M.: Growth properties of power-free languages. Comput. Sci. Rev. 6, 187\u2013208 (2012)","journal-title":"Comput. Sci. Rev."},{"key":"19_CR14","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1\u201322 (1906)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."}],"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-319-23660-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T15:44:15Z","timestamp":1676475855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_19","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":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}