On completely multiplicative automatic sequences.

In this article, we prove that all completely multiplicative automatic sequences (a n) n ∈ N defined on C , vanishing or not, can be written in the form a n = b n χ n , where (b n) n ∈ N is an almost constant sequence, and (χ n) n ∈ N is a Dirichlet character. [ABSTRACT FROM AUTHOR]