14 citations · 33 across the 30 of their papers we have counts for
6 papers · 1 filter
Additive word complexity and Walnut
Pierre Popoli, Jeffrey Shallit, Manon Stipulanti
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying t…
On the pseudorandomness of Parry--Bertrand automatic sequences
Pierre Popoli, Manon Stipulanti
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts…
The reflection complexity of sequences over finite alphabets
Jean-Paul Allouche, John M. Campbell, Shuo Li +2
In combinatorics on words, the well-studied factor complexity function $ρ_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer , the…
Automatic Abelian Complexities of Parikh-Collinear Fixed Points
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference…
Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut
Marieh Jahannia, Manon Stipulanti
We explore the Ziv-Lempel and Crochemore factorizations of some classical automatic sequences making an extensive use of the theorem prover Walnut.
Combinatorics on words and generating Dirichlet series of automatic sequences
Jean-Paul Allouche, Jeffrey Shallit, Manon Stipulanti
Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series…