On substitutions closed under derivation: examples
Combinatorics
2019-11-28 v1 Formal Languages and Automata Theory
Abstract
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to any factor of the fixed point is again fixed by a morphism from this set. The first example involves standard episturmian morphisms, and the second concerns the period doubling morphism.
Cite
@article{arxiv.1907.05751,
title = {On substitutions closed under derivation: examples},
author = {Václav Košík and Štěpán Starosta},
journal= {arXiv preprint arXiv:1907.05751},
year = {2019}
}
Comments
10 pages, 1 figures, submitted to Words 2019