{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:45:29Z","timestamp":1776840329088,"version":"3.51.2"},"reference-count":10,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1992]]},"DOI":"10.1051\/ita\/1992260301991","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T09:54:42Z","timestamp":1486029282000},"page":"199-204","source":"Crossref","is-referenced-by-count":79,"title":["Repetitions in the Fibonacci infinite word"],"prefix":"10.1051","volume":"26","author":[{"given":"F.","family":"Mignosi","sequence":"first","affiliation":[]},{"given":"G.","family":"Pirillo","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BERSTEL J., Mots de Fibonacci, S\u00e9minaire d'informatique th\u00e9orique, L.I.T.P., Paris, Ann\u00e9e 1980\/198, pp. 57-78."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. DE LUCA A., A combinatorial property of the Fibonacci words, Inform. Process. Lett., 1981, 12, n. 4, pp. 193-195.0468.20049","DOI":"10.1016\/0020-0190(81)90099-5"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. DEJEAN F., Sur un th\u00e9or\u00e8me de Thue, J. Comb. Theory, Ser. A, 1972, 13, pp. 90-99.0245.20052","DOI":"10.1016\/0097-3165(72)90011-8"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. KARHUM\u00c4KI J., On cube-free \u03c9-words generated by binary morphism, Discr. Appl. Math., 1983, 5, pp. 279-297.0505.03022","DOI":"10.1016\/0166-218X(83)90002-1"},{"key":"R5","unstructured":"5. HARDY G. H. and WRIGHT E. M, An Introduction to the theory of Numbers, Oxford University Press, Fifth edition, 1983.0020.29201568909"},{"key":"R6","unstructured":"6. LOTHAIRE , Combinatorics on words, Addison Wesley, 1983.6759530514.20045"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. RESTIVO A. and SALEMI S., Overlap-free words on two symbols, Lecture Notes in Compt. Sci., 1984, 192, pp. 198-206.8147440572.20038","DOI":"10.1007\/3-540-15641-0_35"},{"key":"R8","unstructured":"8. S\u00c9\u00c9BOLD P., Propri\u00e9t\u00e9s combinatoires des mots infinis engendr\u00e9s par certains morphismes, Th\u00e8se de doctorat, Rapp. Tec. L.I.T.P., 85-14 1985."},{"key":"R9","unstructured":"9. THUE A., \u00dcber unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl., Christiana 1906, Nr. 7. pp. 1-22.37.0066.17"},{"key":"R10","unstructured":"10. THUE A., \u00dcber die gegenseitige Lege gleicher Teile gewisser Zeichenrein, Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl., Christiana 1912, Nr. 1, pp. 1-67.44.0462.01"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260301991\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:55:13Z","timestamp":1568771713000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260301991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"references-count":10,"journal-issue":{"issue":"3"},"alternative-id":["ita1992260301991"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1992260301991","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}