{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:58:10Z","timestamp":1756573090909,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\overline{\\bf t}$ be the infinite fixed point, starting with $1$, of the morphism $\\mu: 0 \\rightarrow 01$, $1 \\rightarrow 10$. An infinite word over $\\lbrace 0, 1 \\rbrace$ is said to be overlap-free if it contains no factor of the form $axaxa$, where $a \\in \\lbrace 0,1 \\rbrace$ and $x \\in \\lbrace 0,1 \\rbrace^*$. We prove that the lexicographically least infinite overlap-free binary word beginning with any specified prefix, if it exists, has a suffix which is a suffix of  $\\overline{\\bf t}$. In particular, the lexicographically least infinite overlap-free binary word is $001001 \\overline{\\bf t}$.<\/jats:p>","DOI":"10.37236\/1365","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T20:57:31Z","timestamp":1578689851000},"source":"Crossref","is-referenced-by-count":17,"title":["Extremal Infinite Overlap-Free Binary Words"],"prefix":"10.37236","volume":"5","author":[{"given":"Jean-Paul","family":"Allouche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Currie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[1998,5,3]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v5i1r27\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v5i1r27\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T01:09:32Z","timestamp":1579309772000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v5i1r27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5,3]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1998,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1365","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[1998,5,3]]},"article-number":"R27"}}