2024/07/22 by Hans Zantema, Zantema, Hans
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #FOS: Computer and information sciences #Mathematical Dynamics and Fractals #Symbolic Computation (cs.SC) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2407.15721
openalex publication_date 2024/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two such representations of a morphic sequence by morphisms represent the same sequence. In particular, we focus on the smallest representations of the subsequences of the binary Fibonacci sequence obtained by only taking the even or odd elements. The proofs we give are induction proofs of several properties simultaneously, and are typically found fully automatically by a tool that we developed.