{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:04Z","timestamp":1753893784702,"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>H. Friedman obtained remarkable results about the longest finite sequence $x$ over a finite alphabet such that for all $i \\ne j$ the word $x[i..2i]$ is not a subsequence of $x[j..2j]$.  In this note we consider what happens when \"subsequence\" is replaced by \"subword\"; we call such a sequence a \"weakly self-avoiding word\".  We prove that over an alphabet of size $1$ or $2$, there is an upper bound on the length of weakly self-avoiding words, while if the alphabet is of size $3$ or more, there exists an infinite weakly self-avoiding word.<\/jats:p>","DOI":"10.37236\/1587","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:09:09Z","timestamp":1578708549000},"source":"Crossref","is-referenced-by-count":0,"title":["Weakly Self-Avoiding Words and a Construction of Friedman"],"prefix":"10.37236","volume":"8","author":[{"given":"Jeffrey","family":"Shallit","sequence":"first","affiliation":[]},{"given":"Ming-wei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2001,2,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1n2\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1n2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:20:06Z","timestamp":1579324806000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v8i1n2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2,7]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2001,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1587","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2001,2,7]]},"article-number":"N2"}}