arXiv · 2010.00920
Hidden automatic sequences
Abstract
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where an, a priori, morphic sequence with a \emph{non-uniform} morphism happens to be an automatic sequence. An example is the Lysënok morphism $a \to aca$, $b \to d$, $c \to b$, $d \to c$, the fixed point of which is also a 2-automatic sequence. Such an identification is useful for the description of the dynamical systems generated by the fixed point. We give several ways to uncover such hidden automatic sequences, and present many examples. We focus in particular on morphisms associated with Grigorchuk(-like) groups.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
J. -P. Allouche, F. M. Dekking, M. Queffélec. 2020-10-02. Hidden automatic sequences. https://arxiv.org/abs/2010.00920
Cite the original work for its findings. Save a collection to share your selection of sources.