2019/03/11 by Shuo Li, Li, Shuo
Computer Science · Mathematics · #semigroups and automata theory #Coding theory and cryptography #Finite Group Theory Research
paper · pdf · doi:10.48550/arxiv.1903.04385
In this article we prove that all completely multiplicative automatic sequences (an)n ∈ N defined on C, vanishing or not, can be written in the form an=bnχn where (bn)n ∈ N is an almost constant sequence, and (χn)n ∈ N is a Dirichlet character.