Automatic sequences fulfill the Sarnak conjecture

Abstract

We present in this article a new method for dealing with automatic sequences. This method allows us to prove a Möbius randomness principle for automatic sequences from which we deduce the Sarnak conjecture for this class of sequences. Furthermore, we can show a prime number theorem for automatic sequences that are generated by strongly connected automata where the initial state is fixed by the transition corresponding to $0$.