3 papers
cs.FL2025
Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
Olivier Carton, Jean-Michel Couvreur, Martin Delacourt +1
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Seq…
cs.FL2025
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…
math.CO2024
The Repetition Threshold for Rote Sequences
Nicolas Ollinger, Jeffrey Shallit
We consider Rote words, which are infinite binary words with factor complexity . We prove that the repetition threshold for this class is . Our technique is purely computa…