Back to Search Start Over

A robust class of linear recurrence sequences.

Authors :
Barloy, Corentin
Fijalkow, Nathanaƫl
Lhote, Nathan
Mazowiecki, Filip
Source :
Information & Computation. Nov2022:Part A, Vol. 289, pN.PAG-N.PAG. 1p.
Publication Year :
2022

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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*EIGENVALUES

Details

Language :
English
ISSN :
08905401
Volume :
289
Database :
Academic Search Index
Journal :
Information & Computation
Publication Type :
Academic Journal
Accession number :
160368826
Full Text :
https://doi.org/10.1016/j.ic.2022.104964