2022/03/20 by Jeffrey Shallit, Shallit, Jeffrey
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Mathematical Dynamics and Fractals #cs.DM #cs.FL #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2203.10504
arxiv created 2022/03/20 · openalex publication_date 2022/03/20 · arxiv updated 2022/03/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and Stoll. We strengthen one of their theorems and disprove one of their conjectures.