{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:27:17Z","timestamp":1773278837192,"version":"3.50.1"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2005,8]]},"abstract":"<jats:p> A set of words over a finite alphabet is called an unavoidable set if every word of sufficiently long length must contain some word from this set as a subword. Motivated by a theorem from automata theory, we introduce the notion of an almost unavoidable set and prove certain asymptotic estimates for the size of almost unavoidable sets of uniform length. <\/jats:p>","DOI":"10.1142\/s0218196705002463","type":"journal-article","created":{"date-parts":[[2005,8,5]],"date-time":"2005-08-05T11:39:48Z","timestamp":1123241988000},"page":"717-724","source":"Crossref","is-referenced-by-count":3,"title":["UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS"],"prefix":"10.1142","volume":"15","author":[{"given":"JASON P.","family":"BELL","sequence":"first","affiliation":[{"name":"Department of Mathematics, Simon Fraser University, 8888 University Dr., Burnaby, BC V5A 1S6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196704001700"},{"key":"rf2","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Combinatorics on Words","volume":"17","author":"Lothaire M.","year":"1983"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90006-8"},{"key":"rf5","series-title":"Pure and Applied Mathematics","volume-title":"Ring Theory. Vol. II","volume":"128","author":"Rowen L. H.","year":"1988"},{"key":"rf6","first-page":"23","volume":"7","author":"Sch\u00fctzenberger M. P.","journal-title":"Inform. Comput."}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196705002463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:27:40Z","timestamp":1565130460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196705002463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":6,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,8]]}},"alternative-id":["10.1142\/S0218196705002463"],"URL":"https:\/\/doi.org\/10.1142\/s0218196705002463","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}