{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:27Z","timestamp":1759637787402},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)90294-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:53:17Z","timestamp":1027633997000},"page":"363-376","source":"Crossref","is-referenced-by-count":21,"title":["Fractional powers in Sturmian words"],"prefix":"10.1016","volume":"255","author":[{"given":"Jacques","family":"Justin","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Pirillo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S0304-3975(99)90294-3_BIB1","first-page":"103","article-title":"Three distance theorems and combinatorics on words","volume":"44","author":"Alessandri","year":"1998","journal-title":"L\u00e9nseignement Math."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB2","series-title":"An introduction to the Theory of Numbers","author":"Hardy","year":"1971"},{"key":"10.1016\/S0304-3975(99)90294-3_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(83)90002-1","article-title":"On cube-free \u03c9-words generated by binary morphism","volume":"5","author":"Karhumaki","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB4","first-page":"773","article-title":"Sequences with precisely k+1k -blocks, solution of problem E2307","volume":"79","author":"Knuth","year":"1972","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(99)90294-3_BIB5","unstructured":"M. Lothaire, Algebraic Combinatorics on Words, Preliminary Version, February 16, 1999, Institut Gaspard Monge, Univ. Marne-la-Vall\u00e9e, 1999."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(89)90046-7","article-title":"Infinite words with linear subword complexity","volume":"65","author":"Mignosi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","article-title":"Repetitions in the Fibonacci infinite word","volume":"26","author":"Mignosi","year":"1992","journal-title":"Inform. Theorique. Appl."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2371431","article-title":"Symbolic dynamics II: Sturmian trajectories","volume":"62","author":"Morse","year":"1940","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0012-365X(94)00236-C","article-title":"Fibonacci numbers and words","volume":"173","author":"Pirillo","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB10","unstructured":"G. Pirillo, From Fibonacci word to Sturmian words, Publ. Mat. Debrecen 54, supplement (1999) 961\u2013971."},{"key":"10.1016\/S0304-3975(99)90294-3_BIB11","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1017\/S1446788700031062","article-title":"The three gap theorem (Steinhaus conjecture)","volume":"5","author":"van Ravenstein","year":"1988","journal-title":"J. Austral. Math. Soc. Ser A"},{"key":"10.1016\/S0304-3975(99)90294-3_BIB12","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1017\/S0305004100042195","article-title":"Gaps and steps for the sequence n\u03b8 mod 1","volume":"63","author":"Slatter","year":"1967","journal-title":"Proc. Cambridge Philos. Soc"},{"key":"10.1016\/S0304-3975(99)90294-3_BIB13","first-page":"1","volume":"I","author":"Thue","year":"1912","journal-title":"Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen Skr. Vid. Kristiania I. Mat. Naturv. Klasse"},{"key":"10.1016\/S0304-3975(99)90294-3_BIB14","doi-asserted-by":"crossref","unstructured":"D. Vandeth, Sturmian words and words with a critical exponent, Theoret. Comput. Sci., in press.","DOI":"10.1016\/S0304-3975(98)00227-8"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599902943?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599902943?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:57:13Z","timestamp":1555707433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599902943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599902943"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)90294-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}