{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:44:51Z","timestamp":1742982291742,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_14","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"159-170","source":"Crossref","is-referenced-by-count":0,"title":["Cyclic Complexity of Words"],"prefix":"10.1007","author":[{"given":"Julien","family":"Cassaigne","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[]},{"given":"Luca Q.","family":"Zamboni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-75414-5_2","volume-title":"Algebraic Informatics","author":"J. Berstel","year":"2007","unstructured":"Berstel, J.: Sturmian and episturmian words (a survey of some recent results). In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol.\u00a04728, pp. 23\u201347. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetition in Words. CRM monograph series, vol.\u00a027. American Mathematical Society (2008)","key":"14_CR2","DOI":"10.1090\/crmm\/027"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-38771-5_10","volume-title":"Developments in Language Theory","author":"F. Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Fox, N.: On the asymptotic abelian complexity of morphic words. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 94\u2013105. Springer, Heidelberg (2013)"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1051\/ita:2005038","volume":"40","author":"J.-P. Borel","year":"2006","unstructured":"Borel, J.-P., Reutenauer, C.: On Christoffel classes. RAIRO Theor. Inform. Appl.\u00a040(1), 15\u201327 (2006)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"2","key":"14_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1142\/S012905410400242X","volume":"15","author":"S. Brlek","year":"2004","unstructured":"Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Internat. J. Found. Comput. Sci.\u00a015(2), 293\u2013306 (2004)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1-3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(03)00397-9","volume":"310","author":"O. Jenkinson","year":"2004","unstructured":"Jenkinson, O., Zamboni, L.Q.: Characterisations of balanced words via orderings. Theoret. Comput. Sci.\u00a0310(1-3), 247\u2013271 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"14_CR7","first-page":"1201","volume":"22","author":"T. Kamae","year":"2002","unstructured":"Kamae, T., Zamboni, L.: Maximal pattern complexity for discrete systems. Ergodic Theory Dynam. Systems\u00a022(4), 1201\u20131214 (2002)","journal-title":"Ergodic Theory Dynam. Systems"},{"issue":"8","key":"14_CR8","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. Comb. Theory, Ser. A\u00a0120(8), 2189\u20132206 (2013)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"14_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"issue":"7","key":"14_CR10","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.disc.2013.01.005","volume":"313","author":"B. Madill","year":"2013","unstructured":"Madill, B., Rampersad, N.: The abelian complexity of the paperfolding word. Discrete Math.\u00a0313(7), 831\u2013838 (2013)","journal-title":"Discrete Math."},{"issue":"5","key":"14_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00512-4","volume":"86","author":"S. Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Inform. Process. Lett.\u00a086(5), 241\u2013246 (2003)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1142\/S0218196713400080","volume":"23","author":"F. Mignosi","year":"2013","unstructured":"Mignosi, F., Restivo, A.: A new complexity function for words based on periodicity. Internat. J. Algebra Comput.\u00a023(4), 963\u2013988 (2013)","journal-title":"Internat. J. Algebra Comput."},{"issue":"1-2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F. Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theoret. Comput. Sci.\u00a0273(1-2), 99\u2013117 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371264","volume":"60","author":"M. Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics. Amer. J. Math.\u00a060, 1\u201342 (1938)","journal-title":"Amer. J. Math."},{"doi-asserted-by":"crossref","unstructured":"Fogg, N.P.: Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Math., vol.\u00a01794. Springer (2002)","key":"14_CR15","DOI":"10.1007\/b13861"},{"issue":"1","key":"14_CR16","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.: Abelian complexity of minimal subshifts. J. Lond. Math. Soc.\u00a083(1), 79\u201395 (2011)","journal-title":"J. Lond. Math. Soc."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-40579-2_23","volume-title":"Combinatorics on Words","author":"M. Rigo","year":"2013","unstructured":"Rigo, M., Salimov, P.: Another generalization of abelian equivalence: Binomial complexity of infinite words. In: Karhum\u00e4ki, J., Lepist\u00f6, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol.\u00a08079, pp. 217\u2013228. Springer, Heidelberg (2013)"},{"issue":"3-4","key":"14_CR18","first-page":"255","volume":"14","author":"A. Saarela","year":"2010","unstructured":"Saarela, A.: Ultimately constant abelian complexity of infinite words. J. Autom. Lang. Comb.\u00a014(3-4), 255\u2013258 (2010)","journal-title":"J. Autom. Lang. Comb."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2012.10.034","volume":"469","author":"O. Turek","year":"2013","unstructured":"Turek, O.: Abelian complexity and abelian co-decomposition. Theoret. Comput. Sci.\u00a0469, 77\u201391 (2013)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T08:27:41Z","timestamp":1674894461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}