2000 character limit reached
A Robust Class of Linear Recurrence Sequences (1908.03890v1)
Published 11 Aug 2019 in cs.FL
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.