A Robust Class of Linear Recurrence Sequences
Formal Languages and Automata Theory
2019-08-13 v1
Abstract
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.
Cite
@article{arxiv.1908.03890,
title = {A Robust Class of Linear Recurrence Sequences},
author = {Corentin Barloy and Nathanaël Fijalkow and Nathan Lhote and Filip Mazowiecki},
journal= {arXiv preprint arXiv:1908.03890},
year = {2019}
}