Some improvements of the S-adic conjecture. - Julien Leroy 002 (Adv. Appl. Math., 2012)

Towards a statement of the S-adic conjecture through examples - Fabien Durand; Julien Leroy 002; Gwénaël Richomme (CoRR, 2012)

Towards an analogue of Cobham's theorem for beta-numerations. - Emilie Charlier; Julien Leroy 002; Michel Rigo (CoRR, 2013)

A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. - Julien Leroy 002; Gwénaël Richomme (Integers, 2013)

An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2. - Julien Leroy 002 (Discret. Math. Theor. Comput. Sci., 2014)

Asymptotic properties of free monoid morphisms. - Emilie Charlier; Julien Leroy 002; Michel Rigo (CoRR, 2015)

Maximal bifix decoding. - Valérie Berthé; Clelia de Felice; Francesco Dolce; Julien Leroy 002; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (Discret. Math., 2015)

Bispecial Factors in the Brun S-Adic System. - Sébastien Labbé 001; Julien Leroy 002 (DLT, 2016)

Generalized Pascal triangle for binomial coefficients of words. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Adv. Appl. Math., 2016)

A Set of Sequences of Complexity 2n+1 2 n + 1. - Julien Cassaigne; Sébastien Labbé 001; Julien Leroy 002 (WORDS, 2017)

Behavior of Digital Sequences Through Exotic Numeration Systems. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Electron. J. Comb., 2017)

Counting Subwords Occurrences in Base-b Expansions. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (CoRR, 2017)

Counting the number of non-zero coefficients in rows of generalized Pascal triangles. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Discret. Math., 2017)

Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". - Émilie Charlier; Julien Leroy 002; Michel Rigo (RAIRO Theor. Informatics Appl., 2017)

The Constant of Recognizability is Computable for Primitive Morphisms. - Fabien Durand; Julien Leroy 002 (J. Integer Seq., 2017)

Specular sets. - Valérie Berthé; Clelia De Felice; Vincent Delecroix; Francesco Dolce; Julien Leroy 002; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (Theor. Comput. Sci., 2017)

Decidability of the isomorphism and the factorization between minimal substitution subshifts. - Fabien Durand; Julien Leroy 002 (CoRR, 2018)

Rigidity and Substitutive Dendric Words. - Valérie Berthé; Francesco Dolce; Fabien Durand; Julien Leroy 002; Dominique Perrin (Int. J. Found. Comput. Sci., 2018)

Counting Subword Occurrences in Base-b Expansions. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Integers, 2018)

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

Preface. - Émilie Charlier; Julien Leroy 002; Michel Rigo (Int. J. Found. Comput. Sci., 2019)

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)

S-adic characterization of minimal dendric shifts. - France Gheeraert; Julien Leroy 002 (CoRR, 2022)

Algebraic characterization of dendricity. - France Gheeraert; Herman Goulet-Ouellet; Julien Leroy 002; Pierre Stas (CoRR, 2024)

Stability properties for subgroups generated by return words. - France Gheeraert; Herman Goulet-Ouellet; Julien Leroy 002; Pierre Stas (CoRR, 2024)

$ mathcal{S}$-adic characterization of minimal dendric shifts. - France Gheeraert; Julien Leroy 002 (Discret. Math. Theor. Comput. Sci., 2025)