References of "Discrete Mathematics and Theoretical Computer Science"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAn S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n + 1) - p(n) ≤ 2
Leroy, Julien UL

in Discrete Mathematics and Theoretical Computer Science (2014), 16(1), 233--286

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 40 (4 UL)