[en] S-adic conjecture ; factor complexity ; special factor ; Rauz y graph

[en] In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S)≤ 3^27. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set
S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.