{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:40Z","timestamp":1725544600778},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_7","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"104-114","source":"Crossref","is-referenced-by-count":2,"title":["On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms"],"prefix":"10.1007","author":[{"given":"Dalia","family":"Krieger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"7_CR2","unstructured":"Berstel, J.: Axel Thue\u2019s papers on repetitions in words: a translation. Publications du Laboratoire de Combinatoire et d\u2019Informatique Math\u00e9matique 20, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al (1995)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-60207-8_25","volume-title":"Jewels are Forever","author":"J. Berstel","year":"1999","unstructured":"Berstel, J.: On the index of Sturmian words. In: Jewels are Forever, pp. 287\u2013294. Springer, Heidelberg (1999)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(03)00213-5","volume":"304","author":"W.-T. Cao","year":"2003","unstructured":"Cao, W.-T., Wen, Z.-Y.: Some properties of the factors of Sturmian sequences. Theoret. Comput. Sci.\u00a0304, 365\u2013385 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/PL00013299","volume":"36","author":"A. Carpi","year":"2000","unstructured":"Carpi, A., de Luca, A.: Special factors, periodicity, and an application to Sturmian words. Acta Informatica\u00a036, 983\u20131006 (2000)","journal-title":"Acta Informatica"},{"key":"7_CR6","unstructured":"Cassaigne, J.: An algorithm to test if a given circular HD0L-language avoids a pattern. In: IFIP World Computer Congress 1994, vol.\u00a01, pp. 459\u2013464. Elsevier (North-Holland) (1994)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/eujc.2000.0496","volume":"23","author":"D. Damanik","year":"2002","unstructured":"Damanik, D., Lenz, D.: The index of Sturmian sequences. European J. Combin.\u00a023, 23\u201329 (2002)","journal-title":"European J. Combin."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc.\u00a016, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BFb0028589","volume-title":"STACS 98","author":"A.E. Frid","year":"1998","unstructured":"Frid, A.E.: On uniform D0L words. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 544\u2013554. Springer, Heidelberg (1998)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(99)90294-3","volume":"255","author":"J. Justin","year":"2001","unstructured":"Justin, J., Pirillo, G.: Fractional powers in Sturmian words. Theoret. Comput. Sci.\u00a0255, 363\u2013376 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","unstructured":"Krieger, D.: On critical exponents in fixed points of injective morphisms"},{"key":"7_CR12","series-title":"Encyclopedia of Mathematics and Its Applications","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. Encyclopedia of Mathematics and Its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation a\n                        \n                  M\n                \u2009=\u2009b\n                        \n                  N\n                \n                        c\n                        \n                  P\n                 in a free group. Michigan Math. J.\u00a09, 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90046-7","volume":"65","author":"F. Mignosi","year":"1989","unstructured":"Mignosi, F.: Infinite words with linear subword complexity. Theoret. Comput. Sci.\u00a065, 221\u2013242 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1051\/ita\/1992260301991","volume":"26","author":"F. Mignosi","year":"1992","unstructured":"Mignosi, F., Pirillo, G.: Repetitions in the Fibonacci infinite word. RAIRO Inform. Th\u00e9or.\u00a026, 199\u2013204 (1992)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/3-540-56939-1_98","volume-title":"Automata, Languages and Programming","author":"F. Mignosi","year":"1993","unstructured":"Mignosi, F., S\u00e9\u00e9bold, P.: If a D0L language is k-power free then it is circular. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 507\u2013518. Springer, Heidelberg (1993)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","volume":"99","author":"B. Moss\u00e9","year":"1992","unstructured":"Moss\u00e9, B.: Puissances de mots et reconnaissabilit\u00e9 des points fixes d\u2019une substitution. Theoret. Comput. Sci.\u00a099, 327\u2013334 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR18","first-page":"1","volume":"1","author":"A. Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl.\u00a01, 1\u201367 (1912)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(98)00227-8","volume":"242","author":"D. Vandeth","year":"2000","unstructured":"Vandeth, D.: Sturmian words and words with critical exponent. Theoret. Comput. Sci.\u00a0242, 283\u2013300 (2000)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:28:13Z","timestamp":1552361293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11672142_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}