Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Rampersad et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: