Automatic sequences are also non-uniformly morphic (Q2232027): Difference between revisions

Most non-uniformly morphic sequences are not automatic, e.g., the Fibonacci word is not the coding of a fixed point of a constant-length morphism. In this short note, the authors show that every automatic sequence is also non-uniformly morphic, i.e., the image under a coding of a fixed point of a non-uniform morphism. To avoid triviality, the alphabet of the latter morphism is the same as the minimal alphabet of its fixed point. For the entire collection see [Zbl 1473.05003].