{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:38Z","timestamp":1759638038732},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_18","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"203-214","source":"Crossref","is-referenced-by-count":8,"title":["Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Q.","family":"Zamboni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0012-365X(93)00147-W","volume":"139","author":"J.P. Allouche","year":"1995","unstructured":"Allouche, J.P., Arnold, A., Berstel, J., Brlek, S., Jockusch, W., Plouffe, S., Sagan, B.E.: A relative of the Thue-Morse sequence. Discrete Math.\u00a0139(1-3), 455\u2013461 (1995)","journal-title":"Discrete Math."},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","volume":"98","author":"J.P. Allouche","year":"1992","unstructured":"Allouche, J.P., Shallit, J.: The ring of k-regular sequences. Theoret. Comput. Sci.\u00a098(2), 163\u2013197 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR3","unstructured":"Blanchet-Sadri, F., Currie, J., Rampersad, N., Fox, N.: Abelian complexity of fixed point of morphism 0 \u21a6 012, 1 \u21a6 02, 2 \u21a6 1. Integers 14, A11 (2014)"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1142\/S0129054111008489","volume":"22","author":"J. Cassaigne","year":"2011","unstructured":"Cassaigne, J., Richomme, G., Saari, K., Zamboni, L.Q.: Avoiding Abelian powers in binary words with bounded Abelian complexity. Internat. J. Found. Comput. Sci.\u00a022(4), 905\u2013920 (2011)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"E.M. Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Systems Theory\u00a07, 138\u2013153 (1973)","journal-title":"Math. Systems Theory"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.aam.2010.05.001","volume":"47","author":"J. Currie","year":"2011","unstructured":"Currie, J., Rampersad, N.: Recurrent words with constant Abelian complexity. Adv. in Appl. Math.\u00a047(1), 116\u2013124 (2011)","journal-title":"Adv. in Appl. Math."},{"issue":"1-2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(99)00199-7","volume":"100","author":"D. Damanik","year":"2000","unstructured":"Damanik, D.: Local symmetries in the period-doubling sequence. Discrete Appl. Math.\u00a0100(1-2), 115\u2013121 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"M. Dekking","year":"1979","unstructured":"Dekking, M.: Strongly nonrepetitive sequences and progression-free sets. J. Combin. Theory Ser. A\u00a027(2), 181\u2013185 (1979)","journal-title":"J. Combin. Theory Ser. A"},{"key":"18_CR9","unstructured":"Greinecker, F.: On the 2-abelian complexity of Thue-Morse subwords (Preprint), arXiv:1404.3906"},{"key":"18_CR10","unstructured":"Huova, M., Karhum\u00e4ki, J.: Observations and problems on k-abelian avoidability. In: Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081), pp. 2215\u20132219 (2011)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2012.03.010","volume":"454","author":"M. Huova","year":"2012","unstructured":"Huova, M., Karhum\u00e4ki, J., Saarela, A.: Problems in between words and abelian words: k-abelian avoidability. Theoret. Comput. Sci.\u00a0454, 172\u2013177 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR12","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)"},{"issue":"7","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1142\/S0129054113400352","volume":"24","author":"J. Karhum\u00e4ki","year":"2013","unstructured":"Karhum\u00e4ki, J., Puzynina, S., Saarela, A.: Fine and Wilf\u2019s theorem for k-abelian periods. Internat. J. Found. Comput. Sci.\u00a024(7), 1135\u20131152 (2013)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"8","key":"18_CR14","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.jcta.2013.08.008","volume":"120","author":"J. Karhum\u00e4ki","year":"2013","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: On a generalization of Abelian equivalence and complexity of infinite words. J. Combin. Theory Ser. A\u00a0120(8), 2189\u20132206 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"18_CR15","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_CR16","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":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M. Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics. Amer. J. Math.\u00a060(4), 815\u2013866 (1938)","journal-title":"Amer. J. Math."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"M. Morse","year":"1940","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics II: Sturmian trajectories. Amer. J. Math.\u00a062(1), 1\u201342 (1940)","journal-title":"Amer. J. Math."},{"key":"18_CR19","unstructured":"Parreau, A., Rigo, M., Vandomme, E.: A conjecture on the 2-abelian complexity of the Thue-Morse word. In: Representing Streams II (2014)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.jcta.2012.09.002","volume":"120","author":"S. Puzynina","year":"2013","unstructured":"Puzynina, S., Zamboni, L.Q.: Abelian returns in Sturmian words. J. Combin. Theory Ser. A\u00a0120(2), 390\u2013408 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"18_CR21","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.aam.2010.01.006","volume":"45","author":"G. Richomme","year":"2010","unstructured":"Richomme, G., Saari, K., Zamboni, L.Q.: Balance and Abelian complexity of the Tribonacci word. Adv. in Appl. Math.\u00a045(2), 212\u2013231 (2010)","journal-title":"Adv. in Appl. Math."},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1112\/jlms\/jdq063","volume":"83","author":"G. Richomme","year":"2011","unstructured":"Richomme, G., Saari, K., Zamboni, L.Q.: Abelian complexity of minimal subshifts. J. Lond. Math. Soc (2)\u00a083(1), 79\u201395 (2011)","journal-title":"J. Lond. Math. Soc. (2)"},{"issue":"3-4","key":"18_CR23","first-page":"255","volume":"14","author":"A. Saarela","year":"2009","unstructured":"Saarela, A.: Ultimately constant abelian complexity of infinite words. J. Autom. Lang. Comb.\u00a014(3-4), 255\u2013258 (2009)","journal-title":"J. Autom. Lang. Comb."}],"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-09698-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:19:32Z","timestamp":1558973972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}