{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:40Z","timestamp":1759638520502},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405785"},{"type":"electronic","value":"9783642405792"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40579-2_18","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T10:24:48Z","timestamp":1376475888000},"page":"161-168","source":"Crossref","is-referenced-by-count":2,"title":["Strongly k-Abelian Repetitions"],"prefix":"10.1007","author":[{"given":"Mari","family":"Huova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","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\u00a022(3), 125\u2013131 (1986)","journal-title":"Information Processing Letters"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"F.M. Dekking","year":"1979","unstructured":"Dekking, F.M.: Strongly non-repetitive sequences and progression-free sets. J. Combin. Theory Ser. A\u00a027(2), 181\u2013185 (1979)","journal-title":"J. Combin. Theory Ser. A"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-19391-0_7","volume-title":"Rainbow of Computer Science","author":"M. Huova","year":"2011","unstructured":"Huova, M., Karhum\u00e4ki, J., Saarela, A., Saari, K.: Local squares, periodicity and finite automata. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Rainbow of Computer Science. LNCS, vol.\u00a06570, pp. 90\u2013101. Springer, Heidelberg (2011)"},{"key":"18_CR5","unstructured":"Huova, M., Karhum\u00e4ki, J.: On the unavoidability of k-abelian squares in pure morphic words. Journal of Integer Sequences 16, article 13.2.9 (2013)"},{"key":"18_CR6","unstructured":"Huova, M.: Existence of an infinite ternary 64-abelian square-free word. Special Issue of the Journal RAIRO - Theoretical Informatics and Applications dedicated to \u201cJournees Montoises d\u2019Informatique Theorique 2012\u201d (submitted)"},{"key":"18_CR7","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.: On a generalization of Abelian equivalence and complexity of infinite words (submitted), arXiv preprint at \n                    \n                      http:\/\/arxiv.org\/abs\/1301.5104"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","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.\u00a0623, pp. 41\u201352. Springer, Heidelberg (1992)"},{"key":"18_CR9","unstructured":"Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-38771-5_33","volume-title":"Developments in Language Theory","author":"R. Merca\u015f","year":"2013","unstructured":"Merca\u015f, R., Saarela, A.: 3-abelian cubes are avoidable on binary alphabets. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 374\u2013383. Springer, Heidelberg (2013)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0129054108005863","volume":"19","author":"P. Ochem","year":"2008","unstructured":"Ochem, P., Rampersad, N., Shallit, J.: Avoiding approximate squares. International Journal of Foundations of Computer Science\u00a019(3), 633\u2013648 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR12","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl.\u00a07, 1\u201322 (1906)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"18_CR13","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. Mat. Nat. Kl.\u00a01, 1\u201367 (1912)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40579-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:40:16Z","timestamp":1558021216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40579-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405785","9783642405792"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40579-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}