{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:53Z","timestamp":1725905453220},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_22","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"296-307","source":"Crossref","is-referenced-by-count":2,"title":["On the Tree of Binary Cube-Free Words"],"prefix":"10.1007","author":[{"given":"Elena A.","family":"Petrova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arseny M.","family":"Shur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","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":"22_CR2","doi-asserted-by":"crossref","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 \n            $$k$$\n          -power free words. Eur. J. Comb. 16, 111\u2013124 (1995)","journal-title":"Eur. J. Comb."},{"key":"22_CR3","doi-asserted-by":"crossref","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 \n            $$k$$\n          -power free words over \n            $$\\sigma $$\n           is empty or perfect. Eur. J. Comb. 24, 573\u2013580 (2003)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"22_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits in a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"key":"22_CR5","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics and Its Applications","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, vol. 17. Addison-Wesley, Reading (1983)"},{"issue":"8","key":"22_CR6","doi-asserted-by":"crossref","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. Comput. Sci. 23(8), 1595\u20131609 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"22_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). doi:\n10.1007\/978-3-642-32589-2_65"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-23660-5_19","volume-title":"Combinatorics on Words","author":"EA Petrova","year":"2015","unstructured":"Petrova, E.A., Shur, A.M.: On the tree of ternary square-free words. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 223\u2013236. Springer, Cham (2015). doi:\n10.1007\/978-3-319-23660-5_19"},{"key":"22_CR9","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. F12, pp. 289\u2013295. Springer, Heidelberg (1985). doi:\n10.1007\/978-3-642-82456-2_20"},{"key":"22_CR10","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":"J. Reine Angew. Math."},{"key":"22_CR11","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":"J. Reine Angew. Math."},{"key":"22_CR12","doi-asserted-by":"crossref","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":"22_CR13","doi-asserted-by":"crossref","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":"22_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","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:42:56Z","timestamp":1500525776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}