A robust class of linear recurrence sequences
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki · Information and Computation · 2022
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several characterisations: polynomially ambiguous weighted automata, copyless cost-register automata, rational formal series, and linear recurrence sequences whose eigenvalues are roots of rational numbers.