{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:32:19Z","timestamp":1742995939563,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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-15579-1_33","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"424-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Square-Free Words over Partially Commutative Alphabets"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Mikulski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pi\u0105tkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J., Currie, J.D., Shallit, J.: Extremal infinite overlap-free binary words. Electr. J. Comb. 5 (1998)","DOI":"10.37236\/1365"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Allouche, J., Shallit, J.O.: Automatic Sequences - Theory, Applications, Generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-58131-6_34","volume-title":"Results and Trends in Theoretical Computer Science","author":"J Berstel","year":"1994","unstructured":"Berstel, J.: A rewriting of Fife\u2019s theorem about overlap-free words. In: Karhum\u00e4ki, J., Maurer, H., Rozenberg, G. (eds.) Results and Trends in Theoretical Computer Science, pp. 19\u201329. Springer, Heidelberg (1994)"},{"key":"33_CR4","first-page":"65","volume":"11","author":"J Berstel","year":"1992","unstructured":"Berstel, J.: Axel Thue\u2019s work on repetitions in words. S\u00e9ries formelles et combinatoire alg\u00e9brique 11, 65\u201380 (1992)","journal-title":"S\u00e9ries formelles et combinatoire alg\u00e9brique"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"FJ Brandenburg","year":"1983","unstructured":"Brandenburg, F.J.: Uniformly growing $$k$$-th power-free homomorphisms. Theoretical Computer Science 23(1), 69\u201382 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"33_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(97)88002-X","volume":"81","author":"A Carpi","year":"1998","unstructured":"Carpi, A.: On the number of abelian square-free words on four letters. Discrete Applied Mathematics 81(1\u20133), 155\u2013167 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(98)00250-3","volume":"218","author":"A Carpi","year":"1999","unstructured":"Carpi, A.: On abelian squares and substitutions. Theoretical Computer Science 218(1), 61\u201381 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(86)90056-6","volume":"22","author":"A Carpi","year":"1986","unstructured":"Carpi, A., de Luca, A.: Square-free words on partially commutative free monoids. Information Processing Letters 22(3), 125\u2013131 (1986)","journal-title":"Information Processing Letters"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Cartier, P., Foata, D.: Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. LNM, vol. 85. Springer, Heidelberg (1969)","DOI":"10.1007\/BFb0079468"},{"key":"33_CR10","first-page":"509","volume":"24","author":"R Cori","year":"1990","unstructured":"Cori, R., Formisano, M.R.: ITA. Partially abelian squarefree words 24, 509\u2013520 (1990)","journal-title":"Partially abelian squarefree words"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0304-3975(91)90322-S","volume":"81","author":"R Cori","year":"1991","unstructured":"Cori, R., Formisano, M.R.: On the number of partially abelian square-free words on a three-letter alphabet. Theoretical Computer Science 81(1), 147\u2013153 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"33_CR12","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. European Journal of Combinatorics 16(2), 111\u2013124 (1995)","journal-title":"European Journal of Combinatorics"},{"key":"33_CR13","first-page":"221","volume":"6","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P.: Some unsolved problems. Magyar Tud. Akad. Mat. Kutat\u00f3 6, 221\u2013254 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3"},{"key":"33_CR14","first-page":"1268","volume":"179","author":"A Evdokimov","year":"1968","unstructured":"Evdokimov, A.: Strongly asymmetric sequences generated by a finite number of symbols. Dokl. Akad. Nauk. SSSR 179, 1268\u20131271 (1968)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_62","volume-title":"Automata, Languages and Programming","author":"V Ker\u00e4nen","year":"1992","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623. Springer, Heidelberg (1992)"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Lothaire : Algebraic Combinatorics on Words. Encyclopedia of mathematics and its application, vol. 90. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Mikulski, \u0141., Pi\u0105tkowski, M., Rytter, W.: Square-free words over partially commutative alphabets. CS-TR 1439, Newcstle University (2014)","DOI":"10.1007\/978-3-319-15579-1_33"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0305004100046077","volume":"68","author":"PAB Pleasants","year":"1970","unstructured":"Pleasants, P.A.B.: Non-repetitive sequences. Mathematical Proceedings of the Cambridge Philosophical Society 68, 267\u2013274 (1970)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"33_CR19","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Videnskabsselskabets Skrifter, I Mat.-nat. K1, 1\u201322 (1906)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:14:57Z","timestamp":1676434497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_33","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":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}