Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
State Complexity of Shifts of the Fibonacci Word
Delaram Moradi, Pierre Popoli, Jeffrey Shallit +1
The Fibonacci infinite word is one of the most celebrated objects in combinatorics on words. There is a simple -state automaton tha…
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…