14 citations · 33 across the 30 of their papers we have counts for
3 papers · 1 filter
Doubling modulo odd integers, generalizations, and unexpected occurrences
Jean-Paul Allouche, Manon Stipulanti, Jia-Yan Yao
The starting point of this work is an equality between two quantities and found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {…
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger +3
Generalized abelian equivalence compares words by their factors up to a certain bounded length. The associated complexity function counts the equivalence classes for factors of a g…
Positionality of Dumont--Thomas numeration systems for integers
Savinien Kreczman, Sébastien Labbé, Manon Stipulanti
Introduced in 2001 by Lecomte and Rigo, abstract numeration systems provide a way of expressing natural numbers with words from a language accepted by a finite automaton. As it…