A study of dendricity through the lens of morphisms
Dendric languages were introduced a decade ago as a generalization of both Arnoux-Rauzy languages and codings of regular interval exchange transformations. Right away, they were shown to possess strong algebraic properties, as well as being stable under fundamental operations. A few years later, Dolce and Perrin studied the more general notion of eventual dendricity. In this these, we explore another aspect of (eventual) dendricity and delve deeper into the link with morphisms. We mainly study for aspects: the evolution of the factor complexity when applying a morphism, the morphisms preserving dendricity for all languages, a characterization of the preservation of dendricity for some specific morphisms and an S-adic characterization of (eventually) dendric languages leading to decidability in the morphic case.