Enumeration and Automatic Sequences
Jeffrey O. Shallit · Pure mathematics and applications · 2015
Abstract A sequence (a n )n≥0 is k-automatic if there is a finite automaton that, on input n expressed in base k, reaches a state with output a n . In this paper I will survey some recent advances concerning enumeration of various aspects of these sequences, such as the recurrence function, and the subword complexity (which counts the number of distinct blocks of length n).