research
∙
08/21/2023
Algebraic power series and their automatic complexity I: finite fields
Christol's theorem states that a power series with coefficients in a fin...
share
research
∙
04/06/2023
Magic numbers in periodic sequences
In formal languages and automata theory, the magic number problem can be...
research
∙
02/27/2023
String attractors of fixed points of k-bonacci-like morphisms
Firstly studied by Kempa and Prezza in 2018 as the cement of text compre...
research
∙
01/17/2022
On digital sequences associated with Pascal's triangle
We consider the sequence of integers whose nth term has base-p expansion...
research
∙
01/12/2022
Binomial Complexities and Parikh-Collinear Morphisms
Two words are k-binomially equivalent, if each word of length at most k ...
research
∙
06/06/2021
Closed Ziv-Lempel factorization of the m-bonacci words
A word w is said to be closed if it has a proper factor x which occurs e...
research
∙
03/31/2021
Revisiting regular sequences in light of rational base numeration systems
Regular sequences generalize the extensively studied automatic sequences...
research
∙
02/22/2021
Automatic sequences: from rational bases to trees
The nth term of an automatic sequence is the output of a deterministic f...
research
∙
12/09/2020
Regular sequences and synchronized sequences in abstract numeration systems
The notion of b-regular sequences was generalized to abstract numeration...
research
∙
06/19/2020
Robustness of Pisot-regular sequences
We consider numeration systems based on a d-tuple 𝐔=(U_1,…,U_d) of seque...
research
∙
05/06/2020
Avoiding 5/4-powers on the alphabet of nonnegative integers
We identify the structure of the lexicographically least word avoiding 5...
research
∙
05/03/2019
Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words
We introduce a variation of the Ziv-Lempel and Crochemore factorizations...
research
∙
04/25/2018