{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T08:40:22Z","timestamp":1756456822294,"version":"3.44.0"},"reference-count":15,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":240,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2017-03901"],"award-info":[{"award-number":["2017-03901"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2019-04111"],"award-info":[{"award-number":["2019-04111"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2025,8,6]]},"published-print":{"date-parts":[[2025]]},"abstract":"<jats:p>A 4<jats:sup>\u2212<\/jats:sup>-power is a non-empty word of the form <jats:italic>XXXX<\/jats:italic><jats:sup>\u2212<\/jats:sup>, where <jats:italic>X<\/jats:italic><jats:sup>\u2212<\/jats:sup> is obtained from <jats:italic>X<\/jats:italic> by erasing the last letter. A binary word is called <jats:italic>faux-bonacci<\/jats:italic> if it contains no 4<jats:sup>\u2212<\/jats:sup>-powers, and no factor 11. We show that faux-bonacci words bear the same relationship to the Fibonacci morphism that overlap-free words bear to the Thue-Morse morphism. We prove the analogue of Fife\u2019s Theorem for faux-bonacci words, and characterize the lexicographically least and greatest infinite faux-bonacci words.<\/jats:p>","DOI":"10.1051\/ita\/2025009","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T07:58:55Z","timestamp":1756454335000},"page":"7","source":"Crossref","is-referenced-by-count":0,"title":["The analogue of overlap-freeness for the Fibonacci morphism"],"prefix":"10.1051","volume":"59","author":[{"given":"James D.","family":"Currie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"R1","first-page":"1","volume":"1","author":"Thue","year":"1912","journal-title":"Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Restivo A. and Salemi S., Overlap-free words on two symbols, in Automata on Infinite Words, Vol. 192 of Lect. Notes in Comp. Sci., edited by Nivat M. and Perrin D.. Springer-Verlag (1984) 198\u2013206.","DOI":"10.1007\/3-540-15641-0_35"},{"key":"R3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(88)90078-9","volume":"20","author":"Kobayashi","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"R4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(93)90118-D","volume":"115","author":"Carpi","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Cassaigne J., Counting overlap-free binary words, in STACS 93, Proc. 10th Symp. Theoretical Aspects of Comp. Sci., Lect. Notes in Comp. Sci., Vol. 665, edited by Enjalbert P., Finkel A., and Wagner K.. Springer-Verlag (1993) 216\u2013225.","DOI":"10.1007\/3-540-56503-5_24"},{"key":"R6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10208-012-9121-0","volume":"13","author":"Guglielmi","year":"2013","journal-title":"Found. Comput. Math."},{"key":"R7","doi-asserted-by":"crossref","first-page":"3670","DOI":"10.1016\/j.tcs.2009.04.022","volume":"410","author":"Jungers","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"R8","first-page":"115","volume":"261","author":"Fife","year":"1980","journal-title":"Trans. Amer. Math. Soc."},{"key":"R9","unstructured":"Rampersad N., Overlap-Free Words and Generalizations, PhD thesis. University of Waterloo (2007)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Berstel J., A rewriting of Fife\u2019s theorem about overlap-free words, in Results and Trends in Theoretical Computer Science, Lect. Notes in Comp. Sci., Vol. 812, edited by Karhum\u00e4ki J., Maurer H. and Rozenberg G.. Springer-Verlag (1994) 19\u201329.","DOI":"10.1007\/3-540-58131-6_34"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Allouche J.-P., Currie J.D. and Shallit J., Extremal infinite overlap-free binary words. Electron. J. Combin. 5 (1998). #R27.","DOI":"10.37236\/1365"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Allouche J.-P. and Shallit J., The ubiquitous Prouhet\u2013Thue\u2013Morse sequence, Sequences and their Applications, Proceedings of SETA \u201998, edited by in Ding C., Helleseth T. and Niederreiter H.. Springer-Verlag (1998) 1\u201316.","DOI":"10.1007\/978-1-4471-0551-0_1"},{"key":"R13","first-page":"23","volume":"26","author":"Currie","year":"2023","journal-title":"J. Int. Seq."},{"key":"R14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(99)00199-7","volume":"100","author":"Damanik","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Berstel J., Fibonacci words \u2013 a survey, in The Book of L, edited by Rozenberg G. and Salomaa A.. Springer-Verlag  (1986) 13\u201327.","DOI":"10.1007\/978-3-642-95486-3_2"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2025009\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T07:59:06Z","timestamp":1756454346000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2025009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":15,"alternative-id":["ita240027"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2025009","relation":{},"ISSN":["0988-3754","2804-7346"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"2804-7346","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}