Some properties of morphic images of (eventually) dendric words (Q6072923)

A bi-infinite word is eventually dendric if the extension graph of every of its sufficiently long factors is a tree. The first of the results of the paper is the equivalence of this property to eventual neutrality, defined as a property which could be weaker: it concerns only the number of vertices and edges in the extension graph, \(\#E=\#V-1\), but not its structure. However, the length of words starting from which each of the properties hold can be different. Other results of the paper include, first, an upper bound for the factor complexity of an image of an eventually dendric word under a non-erasing morphism: it can only increase by a constant. Another result is a characterization of morphisms preserving dendricity for all dendric words: they are exactly compositions of Arnoux-Rauzy morphisms.