Hidden automatic sequences
Jean Paul Allouche (ENS-PSL Research University & CNRS)
F. Michel Dekking (TU Delft - Applied Probability)
Martine Queffélec (Universite Lille-1)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, morphic sequences are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where an, a priori, morphic sequence with a non-uniform morphism happens to be an automatic sequence. An example is the Lysënok morphism a → aca, b → d, c → b, d → c, the fixed point of which is also a 2-automatic sequence. Such an identification is useful for describing 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 groups.
help_outline