{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:14Z","timestamp":1753893794740,"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>Generalizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th term of the $\\ell$-boundary sequence of an infinite word is the finite set of pairs $(u,v)$ of prefixes and suffixes of length $\\ell$ appearing in factors $uyv$ of length $n+\\ell$ ($n\\ge \\ell\\ge 1$). Otherwise stated, for increasing values of $n$, one looks for all pairs of factors of length $\\ell$ separated by $n-\\ell$ symbols.\r\nFor the large class of addable abstract numeration systems $S$, we show that if an infinite word is $S$-automatic, then the same holds for its $\\ell$-boundary sequence. In particular, they are both morphic (or generated by an HD0L system). To precise the limits of this result, we discuss examples of non-addable numeration systems and $S$-automatic words for which the boundary sequence is nevertheless $S$-automatic and conversely, $S$-automatic words with a boundary sequence that is not $S$-automatic. In the second part of the paper, we study the $\\ell$-boundary sequence of a Sturmian word. We show that it is obtained through a sliding block code from the characteristic Sturmian word of the same slope.\r\nWe also show that it is the image under a morphism of some other characteristic Sturmian word.<\/jats:p>","DOI":"10.37236\/11728","type":"journal-article","created":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T09:52:53Z","timestamp":1706262773000},"source":"Crossref","is-referenced-by-count":0,"title":["On Extended Boundary Sequences of Morphic and Sturmian Words"],"prefix":"10.37236","volume":"31","author":[{"given":"Michel","family":"Rigo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manon","family":"Stipulanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Whiteland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2024,1,12]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i1p9\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i1p9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T09:52:53Z","timestamp":1706262773000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i1p9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1,12]]}},"URL":"https:\/\/doi.org\/10.37236\/11728","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"article-number":"P1.9"}}