{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:55:31Z","timestamp":1742954131804,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202969"},{"type":"electronic","value":"9783319202976"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20297-6_8","type":"book-chapter","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T01:55:05Z","timestamp":1434938105000},"page":"109-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Growth and Fluctuation of k-Abelian Complexity"],"prefix":"10.1007","author":[{"given":"Julien","family":"Cassaigne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1051\/ita:2005003","volume":"39","author":"J Balogh","year":"2005","unstructured":"Balogh, J., Bollob\u00e1s, B.: Hereditary properties of words. RAIRO Inform. Theor. Appl. 39(1), 49\u201365 (2005)","journal-title":"RAIRO Inform. Theor. Appl."},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/eujc.1996.0110","volume":"18","author":"J Cassaigne","year":"1997","unstructured":"Cassaigne, J., Karhum\u00e4ki, J.: Toeplitz words, generalized periodicity and periodically iterated morphisms. Eur. J. Comb. 18(5), 497\u2013510 (1997)","journal-title":"Eur. J. Comb."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"EM Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Syst. Theory 7, 138\u2013153 (1973)","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"8_CR4","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 27(2), 181\u2013185 (1979)","journal-title":"J. Combin. Theory Ser. A"},{"key":"8_CR5","unstructured":"Greinecker, F.: On the 2-abelian complexity of Thue-Morse subwords (Preprint). arXiv:1404.3906"},{"key":"8_CR6","unstructured":"Harmaala, E.: Sanojen ekvivalenssiluokkien laskentaa (2010) (manuscript)"},{"key":"8_CR7","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. 454, 172\u2013177 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR8","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. 6570, pp. 90\u2013101. Springer, Heidelberg (2011)"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00537017","volume":"13","author":"K Jacobs","year":"1969","unstructured":"Jacobs, K., Keane, M.: $$0-1$$-sequences of Toeplitz type. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 13(2), 123\u2013131 (1969)","journal-title":"Z. Wahrscheinlichkeitstheorie und Verw. Gebiete"},{"issue":"8","key":"8_CR10","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 120(8), 2189\u20132206 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-319-09698-8_18","volume-title":"Developments in Language Theory","author":"J Karhum\u00e4ki","year":"2014","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: Variations of the Morse-Hedlund theorem for k-abelian equivalence. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 203\u2013214. Springer, Heidelberg (2014)"},{"key":"8_CR12","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. 623, pp. 41\u2013152. Springer, Heidelberg (1992)"},{"key":"8_CR13","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. 7907, pp. 374\u2013383. Springer, Heidelberg (2013)"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1051\/ita\/2014020","volume":"48","author":"R Merca\u015f","year":"2014","unstructured":"Merca\u015f, R., Saarela, A.: $$5$$-abelian cubes are avoidable on binary alphabets. RAIRO Inform. Theor. Appl. 48(4), 467\u2013478 (2014)","journal-title":"RAIRO Inform. Theor. Appl."},{"issue":"4","key":"8_CR15","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. 60(4), 815\u2013866 (1938)","journal-title":"Amer. J. Math."},{"issue":"1","key":"8_CR16","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. 62(1), 1\u201342 (1940)","journal-title":"Amer. J. Math."},{"issue":"1","key":"8_CR17","doi-asserted-by":"crossref","first-page":"P1.27","DOI":"10.37236\/4478","volume":"22","author":"A Parreau","year":"2015","unstructured":"Parreau, A., Rigo, M., Rowland, E., Vandomme, E.: A new approach to the 2-regularity of the $$l$$-abelian complexity of 2-automatic sequences. Electron. J. Combin. 22(1), P1.27 (2015)","journal-title":"Electron. J. Combin."},{"key":"8_CR18","unstructured":"Rao, M.: On some generalizations of abelian power avoidability (Manuscript)"},{"key":"8_CR19","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. 7, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr. I. Mat. Nat. Kl."},{"key":"8_CR20","first-page":"1","volume":"1","author":"A Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige lage gleicher teile gewisser zeichen-reihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. 1, 1\u201367 (1912)","journal-title":"Norske Vid. Selsk. Skr. I. Mat. Nat. Kl."}],"container-title":["Lecture Notes in Computer Science","Computer Science -- Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20297-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:50:24Z","timestamp":1676944224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20297-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202969","9783319202976"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6_8","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":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}