Published Online: Oct 07, 2015
Page range: 96 - 106
Received: Jul 10, 2014
DOI: https://doi.org/10.1515/puma-2015-0008
Keywords
© 2015
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
A sequence (an)n≥0 is k-automatic if there is a finite automaton that, on input n expressed in base k, reaches a state with output an. 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).