Repetition factorization of automatic sequences (Q6989489)

In combinatorics on words, a repetition is a (fractional) power of exponent at least \(2\) and a word has a repetition factorization if it is the product of repetitions. After the preliminaries in Section 1, Section 2 is devoted to the general case of repetition factorizations in (generalized) automatic sequences, where the famous theorem of Büchi, linking first-order logic to automatic sequences, is used. The subsequent sections are devoted to specific sequences where the results are made more precise using the theorem prover \texttt{Walnut}: Section 3 is devoted to the Fibonacci sequence, Section 4 to the Thue-Morse sequence, Section 5 to paperfolding sequences, and Section 6 to the Rudin-Shapiro sequence. The paper ends with Section 7 where the authors present some open problems for further investigation.