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

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)

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

The Formal Inverse of the Period-Doubling Sequence. - Narad Rampersad; Manon Stipulanti (J. Integer Seq., 2018)

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (CoRR, 2019)

Cobham's Theorem and Automaticity. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit; Manon Stipulanti (Int. J. Found. Comput. Sci., 2019)

Nyldon words. - Émilie Charlier; Manon Philibert; Manon Stipulanti (J. Comb. Theory A, 2019)

Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (Theor. Comput. Sci., 2019)

Convergence of Pascal-like triangles in Parry-Bertrand numeration systems. - Manon Stipulanti (Theor. Comput. Sci., 2019)

Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract). - Eric Rowland; Manon Stipulanti (DLT, 2020)

Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers. - Eric Rowland; Manon Stipulanti (Electron. J. Comb., 2020)

Robustness of Pisot-regular sequences. - Émilie Charlier; Célia Cisternino; Manon Stipulanti (Adv. Appl. Math., 2021)

Closed Ziv-Lempel factorization of the m-bonacci words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (CoRR, 2021)

A Full Characterization of Bertrand Numeration Systems. - Émilie Charlier; Célia Cisternino; Manon Stipulanti (DLT, 2022)

Binomial Complexities and Parikh-Collinear Morphisms. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (DLT, 2022)

On digital sequences associated with Pascal's triangle. - Pierre Mathonet; Michel Rigo; Manon Stipulanti; Naïm Zénaïdi (CoRR, 2022)

Revisiting regular sequences in light of rational base numeration systems. - Michel Rigo; Manon Stipulanti (Discret. Math., 2022)

Automatic sequences: from rational bases to trees. - Michel Rigo; Manon Stipulanti (Discret. Math. Theor. Comput. Sci., 2022)

Regular sequences and synchronized sequences in abstract numeration systems. - Émilie Charlier; Célia Cisternino; Manon Stipulanti (Eur. J. Comb., 2022)

Closed Ziv-Lempel factorization of the m-bonacci words. - Marieh Jahannia; Morteza Mohammad Noori; Narad Rampersad; Manon Stipulanti (Theor. Comput. Sci., 2022)

String Attractors of Fixed Points of k-Bonacci-Like Morphisms. - France Gheeraert; Giuseppe Romana; Manon Stipulanti (WORDS, 2023)

Magic Numbers in Periodic Sequences. - Savinien Kreczman; Luca Prigioniero; Eric Rowland; Manon Stipulanti (WORDS, 2023)

Automaticity and Parikh-Collinear Morphisms. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (WORDS, 2023)

Gapped Binomial Complexities in Sequences. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (ISIT, 2023)

Algebraic power series and their automatic complexity I: finite fields. - Eric Rowland; Manon Stipulanti; Reem Yassawi (CoRR, 2023)

Summing the sum of digits. - Jean-Paul Allouche; Manon Stipulanti (CoRR, 2023)

Additive Word Complexity and Walnut. - Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (FSTTCS, 2024)

On the Pseudorandomness of Parry-Bertrand Automatic Sequences. - Pierre Popoli; Manon Stipulanti (ICTCS, 2024)

On Extended Boundary Sequences of Morphic and Sturmian Words. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (Electron. J. Comb., 2024)

Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut. - Marieh Jahannia; Manon Stipulanti (CoRR, 2024)

The reflection complexity of sequences over finite alphabets. - Jean-Paul Allouche; John M. Campbell 001; Jeffrey O. Shallit; Manon Stipulanti (CoRR, 2024)

Characterizations of families of morphisms and words via binomial complexities. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (Eur. J. Comb., 2024)

New string attractor-based complexities for infinite words. - Julien Cassaigne; France Gheeraert; Antonio Restivo; Giuseppe Romana; Marinella Sciortino; Manon Stipulanti (J. Comb. Theory, Ser. A, 2024)

String Attractors of Some Simple-Parry Automatic Sequences. - France Gheeraert; Giuseppe Romana; Manon Stipulanti (Theory Comput. Syst., 2024)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (Theory Comput. Syst., 2024)

A Succinct Study of Positionality for Dumont-Thomas Numeration Systems. - Savinien Kreczman; Sébastien Labbé 001; Manon Stipulanti (WORDS, 2025)

Combinatorics on words and generating Dirichlet series of automatic sequences. - Jean-Paul Allouche; Jeffrey O. Shallit; Manon Stipulanti (Discret. Math., 2025)

An elementary proof of Bridy's theorem. - Eric Rowland; Manon Stipulanti; Reem Yassawi (Finite Fields Their Appl., 2025)

Positionality of Dumont-Thomas numeration systems for integers. - Savinien Kreczman; Sébastien Labbé 001; Manon Stipulanti (CoRR, 2025)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. - Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger; Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (CoRR, 2025)