{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:23Z","timestamp":1759638863707},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,14]],"date-time":"2013-11-14T00:00:00Z","timestamp":1384387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00224-013-9512-x","type":"journal-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T20:20:25Z","timestamp":1384287625000},"page":"224-243","source":"Crossref","is-referenced-by-count":5,"title":["Growth of Power-Free Languages over Large Alphabets"],"prefix":"10.1007","volume":"54","author":[{"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,14]]},"reference":[{"key":"9512_CR1","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.tcs.2005.03.039","volume":"340","author":"J. Berstel","year":"2005","unstructured":"Berstel, J.: Growth of repetition-free words\u2014a review. Theor. Comput. Sci. 340, 280\u2013290 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9512_CR2","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhum\u00e4ki, J.: Combinatorics on words: a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. 79, 178\u2013228 (2003)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"9512_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"F.-J. Brandenburg","year":"1983","unstructured":"Brandenburg, F.-J.: Uniformly growing k-th power free homomorphisms. Theor. Comput. Sci. 23, 69\u201382 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"9512_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.tcs.2007.06.001","volume":"385","author":"A. Carpi","year":"2007","unstructured":"Carpi, A.: On Dejean\u2019s conjecture over large alphabets. Theor. Comput. Sci. 385, 137\u2013151 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9512_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M. Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67(3), 111\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9512_CR6","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1051\/ita\/2009017","volume":"43","author":"J.D. Currie","year":"2009","unstructured":"Currie, J.D., Rampersad, N.: Dejean\u2019s conjecture holds for n\u226527, RAIRO. Inform. Th\u00e9or. Appl. 43, 775\u2013778 (2009)","journal-title":"Inform. Th\u00e9or. Appl."},{"key":"9512_CR7","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"J.D. Currie","year":"2011","unstructured":"Currie, J.D., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comput. 80, 1063\u20131070 (2011)","journal-title":"Math. Comput."},{"key":"9512_CR8","volume-title":"Spectra of Graphs. Theory and Applications","author":"D.M. Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Theory and Applications, 3rd edn. Johann Ambrosius Barth, Heidelberg (1995)","edition":"3"},{"issue":"1","key":"9512_CR9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F. Dejean","year":"1972","unstructured":"Dejean, F.: Sur un theoreme de Thue. J. Comb. Theory, Ser. A 13(1), 90\u201399 (1972)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9512_CR10","volume-title":"Application of the Theory of Matrices","author":"F.R. Gantmacher","year":"1959","unstructured":"Gantmacher, F.R.: Application of the Theory of Matrices. Interscience, New York (1959)"},{"key":"9512_CR11","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"9512_CR12","doi-asserted-by":"crossref","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M. Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics. Am. J. Math. 60, 815\u2013866 (1938)","journal-title":"Am. J. Math."},{"key":"9512_CR13","doi-asserted-by":"crossref","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M. Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theor. Comput. Sci. 412, 3010\u20133018 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9512_CR14","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1051\/ita:2008021","volume":"42","author":"A.M. Shur","year":"2008","unstructured":"Shur, A.M.: Comparing complexity functions of a language and its extendable part. RAIRO Theor. Inform. Appl. 42, 647\u2013655 (2008)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"9512_CR15","series-title":"LNCS","first-page":"289","volume-title":"Proc. 3rd International Computer Science Symposium in Russia","author":"A.M. Shur","year":"2008","unstructured":"Shur, A.M.: Combinatorial complexity of regular languages. In: Proc. 3rd International Computer Science Symposium in Russia, LNCS, vol.\u00a05010, pp.\u00a0289\u2013301. Springer, Berlin (2008)"},{"key":"9512_CR16","doi-asserted-by":"crossref","first-page":"3209","DOI":"10.1016\/j.tcs.2010.05.017","volume":"411","author":"A.M. Shur","year":"2010","unstructured":"Shur, A.M.: Growth rates of complexity of power-free languages. Theor. Comput. Sci. 411, 3209\u20133223 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9512_CR17","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/978-3-642-02737-6_38","volume-title":"Developments in Language Theory 2009","author":"A.M. Shur","year":"2009","unstructured":"Shur, A.M.: Two-sided bounds for the growth rates of power-free languages. In: Developments in Language Theory 2009, LNCS, vol.\u00a05583, pp. 466\u2013477. Springer, Berlin (2009)"},{"key":"9512_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/978-3-642-14455-4_37","volume-title":"Developments in Language Theory 2010","author":"A.M. Shur","year":"2010","unstructured":"Shur, A.M.: On the existence of minimal \u03b2-powers. In: Developments in Language Theory 2010, LNCS, vol.\u00a06224, pp.\u00a0411\u2013422. Springer, Berlin (2010)"},{"key":"9512_CR19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1051\/ita\/2010012","volume":"44","author":"A.M. Shur","year":"2010","unstructured":"Shur, A.M., Gorbunova, I.A.: On the growth rates of complexity of threshold languages. RAIRO Theor. Inform. Appl. 44, 175\u2013192 (2010)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"9512_CR20","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christ. 7, 1\u201322 (1906)","journal-title":"Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christ."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9512-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9512-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9512-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:25Z","timestamp":1558684465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9512-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,14]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9512"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9512-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,14]]}}}