The class of (eventually) dendric words generalizes well-known families such as the Arnoux-Rauzy words or the codings of interval exchanges. There are still many open questions about the link between dendricity and morphisms. In this paper, we focus on two questions. The first one is the evolution of the factor complexity when applying a non-erasing morphism to an eventually dendric word. We next look at the morphisms that preserve dendricity for all dendric words and show that they are exactly those generated by the Arnoux-Rauzy morphisms.

翻译：该类（最终）树状字概括了众所周知的族群，例如Arnoux-Rauzy字或区间交换编码。关于树状性质和形构映射之间的联系仍有许多未解的问题。在本文中，我们将重点放在了两个问题上。第一个问题是将非消除形构映射应用于（最终）树状字时，其因子复杂性的演变。接下来，我们研究了保持所有树状字的树状性质的形构映射，证明它们正是Arnoux-Rauzy形构映射生成的。