Templates for the k-Binomial Complexity of the Tribonacci Word. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (WORDS, 2019)

Computing the k-binomial Complexity of the Thue-Morse Word. - Marie Lejeune; Julien Leroy 002; Michel Rigo (DLT, 2019)

Templates for the k-binomial complexity of the Tribonacci word. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (Adv. Appl. Math., 2020)

The binomial equivalence classes of finite words. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (Int. J. Algebra Comput., 2020)

Computing the k-binomial complexity of the Thue-Morse word. - Marie Lejeune; Julien Leroy 002; Michel Rigo (J. Comb. Theory A, 2020)

$ mathcal{S}$-adic characterization of minimal ternary dendric subshifts. - France Gheeraert; Marie Lejeune; Julien Leroy 002 (CoRR, 2021)

Reconstructing Words from Right-Bounded-Block Words. - Pamela Fleischmann; Marie Lejeune; Florin Manea; Dirk Nowotka; Michel Rigo (Int. J. Found. Comput. Sci., 2021)