The following pages link to Manon Stipulanti (Q308969):
Displaying 31 items.
- Generalized Pascal triangle for binomial coefficients of words (Q308970) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Behavior of digital sequences through exotic numeration systems (Q521363) (← links)
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems (Q1755585) (← links)
- Robustness of Pisot-regular sequences (Q2020014) (← links)
- Revisiting regular sequences in light of rational base numeration systems (Q2065907) (← links)
- Regular sequences and synchronized sequences in abstract numeration systems (Q2066012) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- A full characterization of Bertrand numeration systems (Q2163984) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- Avoiding 5/4-powers on the alphabet of nonnegative integers (Q2194095) (← links)
- Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382) (← links)
- Nyldon words (Q2318478) (← links)
- On digital sequences associated with Pascal's triangle (Q2696006) (← links)
- The Formal Inverse of the Period-Doubling Sequence (Q4612104) (← links)
- Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract) (Q5041267) (← links)
- Cobham’s Theorem and Automaticity (Q5207238) (← links)
- Counting Subwords Occurrences in Base-b Expansions (Q5384333) (← links)
- Automatic sequences: from rational bases to trees (Q6045415) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- Combinatorics on words and generating Dirichlet series of automatic sequences (Q6518747) (← links)
- Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut (Q6527216) (← links)
- On extended boundary sequences of morphic and Sturmian words (Q6584085) (← links)
- New string attractor-based complexities for infinite words (Q6612124) (← links)
- Summing the sum of digits (Q6615625) (← links)
- Dyck words, pattern avoidance, and automatic sequences (Q6615627) (← links)
- String attractors of some simple-parry automatic sequences (Q6661762) (← links)
- Automatic abelian complexities of Parikh-collinear fixed points (Q6661763) (← links)
- The reflection complexity of sequences over finite alphabets (Q6732522) (← links)
- On the pseudorandomness of Parry--Bertrand automatic sequences (Q6741708) (← links)
- Additive word complexity and Walnut (Q6747327) (← links)
