$\mathcal{S}$-adic characterization of minimal dendric shifts.

Stability properties for subgroups generated by return words.

Algebraic characterization of dendricity.

S-adic characterization of minimal dendric shifts.

$\mathcal{S}$-adic characterization of minimal ternary dendric subshifts.

Computing the <i>k</i>-binomial complexity of the Thue-Morse word.

Preface.

Counting Subword Occurrences in Base-b Expansions.

Rigidity and Substitutive Dendric Words.

Decidability of the isomorphism and the factorization between minimal substitution subshifts.

Specular sets.

The Constant of Recognizability is Computable for Primitive Morphisms.

Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique".

Counting the number of non-zero coefficients in rows of generalized Pascal triangles.

Counting Subwords Occurrences in Base-b Expansions.

Behavior of Digital Sequences Through Exotic Numeration Systems.

Generalized Pascal triangle for binomial coefficients of words.

Maximal bifix decoding.

Asymptotic properties of free monoid morphisms.

An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2.

A Combinatorial Proof of S-adicity for Sequences with Linear Complexity.

Towards an analogue of Cobham's theorem for beta-numerations.

Towards a statement of the S-adic conjecture through examples

Some improvements of the <i>S</i>-adic conjecture.