Caractérisation S-adique des dendriques

Dendric shift spaces or langages generalize Arnoux-Rauzy words and have interesting properties related to return words. It is known that we can build particular S-adic representations of any given dendric system. In this talk, I explain how we can understand to properties of these representations to obtain a characterization. The main result is the description of a graph such that a system is dendric if and only if it has a primitive S-adic representation labeling an infinite path in this graph.