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...
share
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
∙
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
∙
01/31/2020
On the binomial equivalence classes of finite words
Two finite words u and v are k-binomially equivalent if, for each word x...
research
∙
01/30/2020
Reconstructing Words from Right-Bounded-Block Words
A reconstruction problem of words from scattered factors asks for the mi...
research
∙
02/19/2019
Taking-and-merging games as rewrite games
This work contributes to the study of rewrite games where positions are ...
research
∙
12/18/2018
