{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:36Z","timestamp":1770994056125,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T00:00:00Z","timestamp":1428451200000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00224-015-9629-1","type":"journal-article","created":{"date-parts":[[2015,4,7]],"date-time":"2015-04-07T02:26:33Z","timestamp":1428373593000},"page":"161-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Weak Abelian Periodicity of Infinite Words"],"prefix":"10.1007","volume":"59","author":[{"given":"Sergey","family":"Avgustinovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana","family":"Puzynina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,8]]},"reference":[{"key":"9629_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(03)00092-6","volume":"307","author":"B Adamczewski","year":"2003","unstructured":"Adamczewski, B.: Balances for fixed points of primitive substitutions. Theor. Comput. Sci. 307, 47\u201375 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9629_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/2011121","volume":"46","author":"S Avgustinovich","year":"2012","unstructured":"Avgustinovich, S., Karhum\u00e4ki, J., Puzynina, S.: On abelian versions of critical factorization theorem. RAIRO - Theor. Inform. Appl. 46, 3\u201315 (2012)","journal-title":"RAIRO - Theor. Inform. Appl."},{"key":"9629_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511777653","volume-title":"Combinatorics, Automata and Number Theory","author":"V Berth\u00e9","year":"2010","unstructured":"Berth\u00e9, V., Rigo, M.: Combinatorics, Automata and Number Theory. Cambridge University Press, Cambridge (2010)"},{"issue":"5","key":"9629_CR4","doi-asserted-by":"crossref","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."},{"issue":"4","key":"9629_CR5","doi-asserted-by":"crossref","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. Int. J. Found. Comput. Sci. 22(4), 905\u2013920 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9629_CR6","first-page":"167","volume":"89","author":"S Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for abelian periods. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 89, 167\u2013170 (2006)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"issue":"6","key":"9629_CR7","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1142\/S0129054112500190","volume":"23","author":"M Christou","year":"2012","unstructured":"Christou, M., Crochemore, M., Iliopoulos, C.S.: Identifying all abelian periods of a string in quadratic time and relevant problems. Int. J. Found. Comput. Sci. 23(6), 1371\u20131384 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"9629_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ipl.2012.11.001","volume":"113","author":"M Crochemore","year":"2013","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Pachocki, J., Radoszewski, J., Rytter, W., Tyczynski, W., Walen, T.: A note on efficient computation of all abelian periods in a string. Inf. Process. Lett. 113(3), 74\u201377 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"9629_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discret. Math. 179(1\u20133), 89\u2013101 (1998)","journal-title":"Discret. Math."},{"key":"9629_CR10","first-page":"221","volume":"6","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P.: Some unsolved problems. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 6, 221\u2013254 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"9629_CR11","first-page":"1268","volume":"179","author":"AA Evdokimov","year":"1968","unstructured":"Evdokimov, A.A.: Strongly asymmetric sequences generated by a finite number of symbols. Dokl. Akad. Nauk. SSSR 179, 1268\u20131271 (1968); Soviet Math. Dokl. 9, 536\u2013539 (1968)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"issue":"1","key":"9629_CR12","first-page":"29","volume":"3","author":"A Frid","year":"1998","unstructured":"Frid, A.: On the frequency of factors in D0L words. J. Autom. Lang. Comb. 3(1), 29\u201341 (1998)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"9629_CR13","doi-asserted-by":"crossref","first-page":"357","DOI":"10.2140\/pjm.1979.83.357","volume":"83","author":"JL Gerver","year":"1979","unstructured":"Gerver, J.L., Ramsey, L.T.: On certain sequences of lattice points. Pac. J. Math. 83(2), 357\u2013363 (1979)","journal-title":"Pac. J. Math."},{"key":"9629_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.24033\/bsmf.2324","volume":"126","author":"C Holton","year":"1998","unstructured":"Holton, C., Zamboni, L.Q.: Geometric realizations of substitutions. Bull. Soc. Math. France 126, 149\u2013179 (1998)","journal-title":"Bull. Soc. Math. France"},{"key":"9629_CR15","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Automata, Languages and Programming (Vienna, 1992), volume 623 of Lecture Notes in Comput. Sci., pp. 41\u201352. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55719-9_62"},{"key":"9629_CR16","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Fast algorithms for abelian periods in words and greatest common divisor queries. In: STACS 2013. LIPIcs 20, pp. 245\u2013256. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"9629_CR17","first-page":"27","volume":"34","author":"VA Krajnev","year":"1980","unstructured":"Krajnev, V.A.: Words that do not contain consecutive factors with equal frequencies of letters. Metody Discretnogo Analiza v Reshenii Kombinatornyh Zadach 34, 27\u201337 (1980). [in Russian]","journal-title":"Metody Discretnogo Analiza v Reshenii Kombinatornyh Zadach"},{"key":"9629_CR18","doi-asserted-by":"crossref","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":"1\u20132","key":"9629_CR19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01458701","volume":"84","author":"G P\u00f3lya","year":"1921","unstructured":"P\u00f3lya, G.: \u00dcber eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Strassennetz. Math. Ann. 84(1\u20132), 149\u2013160 (1921)","journal-title":"Math. Ann."},{"issue":"2","key":"9629_CR20","doi-asserted-by":"crossref","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 120(2), 390\u2013408 (2013)","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"1","key":"9629_CR21","doi-asserted-by":"crossref","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. 83(1), 79\u201395 (2011)","journal-title":"J. Lond. Math. Soc."},{"key":"9629_CR22","unstructured":"Saari, K.: On the Frequency and Periodicity of Infinite Words, PhD thesis, Turku (2008)"},{"key":"9629_CR23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/2011127","volume":"46","author":"AV Samsonov","year":"2012","unstructured":"Samsonov, A.V., Shur, A.M.: On Abelian repetition threshold. RAIRO Inform. Theor. Appl. 46, 147\u2013163 (2012)","journal-title":"RAIRO Inform. Theor. Appl."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9629-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9629-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9629-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:27Z","timestamp":1558684467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9629-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,8]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9629"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9629-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,8]]}}}