{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:40Z","timestamp":1725543460550},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_26","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"280-291","source":"Crossref","is-referenced-by-count":0,"title":["On Critical Exponents in Fixed Points of Non-erasing Morphisms"],"prefix":"10.1007","author":[{"given":"Dalia","family":"Krieger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_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":"26_CR2","volume-title":"Introduction to Analytic Number Theory","author":"T.M. Apostol","year":"1976","unstructured":"Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1976)"},{"key":"26_CR3","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":"26_CR4","doi-asserted-by":"crossref","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":"26_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":"26_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":"26_CR7","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":"26_CR8","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":"26_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0019-9958(83)80028-X","volume":"59","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Repetition of subwords in D0L languages. Information and Control\u00a059, 13\u201335 (1983)","journal-title":"Information and Control"},{"key":"26_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":"26_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(99)00238-8","volume":"240","author":"Y. Kobayashi","year":"2000","unstructured":"Kobayashi, Y., Otto, F.: Repetitiveness of languages generated by morphisms. Theoret. Comput. Sci.\u00a0240, 337\u2013378 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11672142_7","volume-title":"STACS 2006","author":"D. Krieger","year":"2006","unstructured":"Krieger, D.: On critical exponents in fixed points of binary k-uniform morphisms. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 104\u2013114. Springer, Heidelberg (2006)"},{"key":"26_CR13","unstructured":"Krieger, D., Shallit, J.: Every real number greater than 1 is a critical exponent (preprint)"},{"key":"26_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":"26_CR15","doi-asserted-by":"crossref","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":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"26_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":"26_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":"26_CR19","unstructured":"Vajda, S.: Fibonacci & Lucas Numbers, and the Golden Section: Theory and Applications. Ellis Horwood Limited (1989)"},{"key":"26_CR20","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","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:50Z","timestamp":1619507750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11779148_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}