{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:35:47Z","timestamp":1725730547687},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_10","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"94-105","source":"Crossref","is-referenced-by-count":1,"title":["On the Asymptotic Abelian Complexity of Morphic Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Nathan","family":"Fox","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"6252","DOI":"10.1016\/j.tcs.2011.08.016","volume":"412","author":"L. Balkov\u00e1","year":"2011","unstructured":"Balkov\u00e1, L., B\u0159inda, K., Turek, O.: Abelian complexity of infinite words associated with quadratic Parry numbers. Theoret. Comput. Sci.\u00a0412, 6252\u20136260 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-57182-5_20","volume-title":"Mathematical Foundations of Computer Science 1993","author":"J. Berstel","year":"1993","unstructured":"Berstel, J., S\u00e9\u00e9bold, P.: A characterization of Sturmian morphisms. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 281\u2013290. Springer, Heidelberg (1993)"},{"key":"10_CR4","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, ch. 6, pp. 329\u2013438. Springer, Berlin (1997)"},{"key":"10_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"},{"key":"10_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. Appl. Math.\u00a047, 116\u2013124 (2011)","journal-title":"Adv. Appl. Math."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A. Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword complexities of various classes of deterministic developmental languages without interactions. Theoret. Comput. Sci.\u00a01, 59\u201375 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(81)90121-6","volume":"13","author":"A. Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexity of D0L languages with a constant distribution. Inform. Process. Lett.\u00a013, 108\u2013113 (1981)","journal-title":"Inform. Process. Lett."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(81)90028-1","volume":"16","author":"A. Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexity of square-free D0L languages. Theoret. Comput. Sci.\u00a016, 25\u201332 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(83)90050-9","volume":"16","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexity of locally catenative D0L languages. Inform. Process. Lett.\u00a016, 121\u2013124 (1983)","journal-title":"Inform. Process. Lett."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0036182","volume-title":"Fundamentals of Computation Theory","author":"A.E. Frid","year":"1997","unstructured":"Frid, A.E.: The subword complexity of fixed points of binary uniform morphisms. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol.\u00a01279, pp. 179\u2013187. Springer, Heidelberg (1997)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-13345-3_34","volume-title":"Automata, Languages, and Programming","author":"J.J. Pansiot","year":"1984","unstructured":"Pansiot, J.J.: Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 380\u2013389. Springer, Heidelberg (1984)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.tcs.2007.03.028","volume":"380","author":"G. Richomme","year":"2007","unstructured":"Richomme, G.: Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theoret. Comput. Sci.\u00a0380, 393\u2013400 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR14","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 in minimal subshifts. J. London Math. Soc.\u00a083, 79\u201395 (2011)","journal-title":"J. London Math. Soc."}],"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-642-38771-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:31:03Z","timestamp":1557779463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}
