Manon Stipulanti

Orcid: 0000-0002-2805-2465

According to our database1, Manon Stipulanti authored at least 36 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New string attractor-based complexities for infinite words.
J. Comb. Theory, Ser. A, 2024

Characterizations of families of morphisms and words via binomial complexities.
Eur. J. Comb., 2024

The reflection complexity of sequences over finite alphabets.
CoRR, 2024

Automatic Abelian Complexities of Parikh-Collinear Fixed Points.
CoRR, 2024

Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut.
CoRR, 2024

Combinatorics on words and generating Dirichlet series of automatic sequences.
CoRR, 2024

On Extended Boundary Sequences of Morphic and Sturmian Words.
Electron. J. Comb., 2024

On the Pseudorandomness of Parry-Bertrand Automatic Sequences.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

2023
Summing the sum of digits.
CoRR, 2023

Algebraic power series and their automatic complexity I: finite fields.
CoRR, 2023

Gapped Binomial Complexities in Sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Automaticity and Parikh-Collinear Morphisms.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

Magic Numbers in Periodic Sequences.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

String Attractors of Fixed Points of k-Bonacci-Like Morphisms.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022
Closed Ziv-Lempel factorization of the <i>m</i>-bonacci words.
Theor. Comput. Sci., 2022

Regular sequences and synchronized sequences in abstract numeration systems.
Eur. J. Comb., 2022

Automatic sequences: from rational bases to trees.
Discret. Math. Theor. Comput. Sci., 2022

Revisiting regular sequences in light of rational base numeration systems.
Discret. Math., 2022

On digital sequences associated with Pascal's triangle.
CoRR, 2022

Binomial Complexities and Parikh-Collinear Morphisms.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

A Full Characterization of Bertrand Numeration Systems.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021
Closed Ziv-Lempel factorization of the m-bonacci words.
CoRR, 2021

Robustness of Pisot-regular sequences.
Adv. Appl. Math., 2021

2020
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers.
Electron. J. Comb., 2020

Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract).
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

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

Palindromic Ziv-Lempel and Crochemore factorizations of <i>m</i>-bonacci infinite words.
Theor. Comput. Sci., 2019

Nyldon words.
J. Comb. Theory A, 2019

Cobham's Theorem and Automaticity.
Int. J. Found. Comput. Sci., 2019

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words.
CoRR, 2019

2018
The Formal Inverse of the Period-Doubling Sequence.
J. Integer Seq., 2018

Counting Subword Occurrences in Base-b Expansions.
Integers, 2018

2017
Counting the number of non-zero coefficients in rows of generalized Pascal triangles.
Discret. Math., 2017

Counting Subwords Occurrences in Base-b Expansions.
CoRR, 2017

Behavior of Digital Sequences Through Exotic Numeration Systems.
Electron. J. Comb., 2017

2016
Generalized Pascal triangle for binomial coefficients of words.
Adv. Appl. Math., 2016


  Loading...