{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:26:17Z","timestamp":1747189577223,"version":"3.40.5"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["2018-04118"],"award-info":[{"award-number":["2018-04118"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["2019-04111"],"award-info":[{"award-number":["2019-04111"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:p> Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least [Formula: see text]. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several (generalized) automatic sequences, including the infinite Fibonacci word, the Thue-Morse word, paperfolding words, and the Rudin-Shapiro sequence. <\/jats:p>","DOI":"10.1142\/s0129054124430019","type":"journal-article","created":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T02:55:06Z","timestamp":1722394506000},"page":"479-499","source":"Crossref","is-referenced-by-count":0,"title":["Repetition Factorization of Automatic Sequences"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7489-0980","authenticated-orcid":false,"given":"Narad","family":"Rampersad","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, University of Winnipeg, 515 Portage Ave., Winnipeg, MB R3B 2E9, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}]},{"given":"Xinhao","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}]}],"member":"219","published-online":{"date-parts":[[2024,7,30]]},"reference":[{"key":"S0129054124430019BIB001","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563"},{"key":"S0129054124430019BIB002","first-page":"57","volume":"6","author":"Berstel J.","year":"1980","journal-title":"S\u00e9minaire d\u2019Informatique Th\u00e9orique, LITP"},{"key":"S0129054124430019BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-95486-3_2"},{"key":"S0129054124430019BIB004","series-title":"Number 20 in Publications du Laboratoire de Combinatoire et d\u2019Informatique Math\u00e9matique","volume-title":"Axel Thue\u2019s Papers on Repetitions in Words: a Translation","author":"Berstel J.","year":"1995"},{"key":"S0129054124430019BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90009-6"},{"key":"S0129054124430019BIB006","first-page":"191","volume":"1","author":"Bruy\u00e8re V.","year":"1994","journal-title":"Bull. Belgian Math. Soc"},{"key":"S0129054124430019BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-022-10070-3"},{"key":"S0129054124430019BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-43980-3_23"},{"key":"S0129054124430019BIB010","first-page":"190","volume":"29","author":"Lekkerkerker C. G.","year":"1952","journal-title":"Simon Stevin"},{"key":"S0129054124430019BIB012","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1959-0116184-5"},{"journal-title":"Canad. J. Math","year":"2023","author":"Schaeffer L.","key":"S0129054124430019BIB013"},{"key":"S0129054124430019BIB015","series-title":"London Math. Soc. Lecture Notes Series","volume-title":"The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut","volume":"482","author":"Shallit J.","year":"2023"},{"key":"S0129054124430019BIB016","doi-asserted-by":"crossref","first-page":"201","DOI":"10.4213\/im301","volume":"64","author":"Shur A. M.","year":"2000","journal-title":"Izv. Ross. Akad. Nauk. Ser. Mat"},{"key":"S0129054124430019BIB018","first-page":"179","volume":"41","author":"Zeckendorf E.","year":"1972","journal-title":"Bull. Soc. Roy. Li\u00e8ge"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054124430019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T03:17:23Z","timestamp":1745551043000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054124430019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,30]]},"references-count":14,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10.1142\/S0129054124430019"],"URL":"https:\/\/doi.org\/10.1142\/s0129054124430019","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2024,7,30]]}}}