Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Barloy et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: