License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2020.9
URN: urn:nbn:de:0030-drops-116521
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11652/
Barloy, Corentin ;
Fijalkow, Nathanaël ;
Lhote, Nathan ;
Mazowiecki, Filip
A Robust Class of Linear Recurrence Sequences
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.
BibTeX - Entry
@InProceedings{barloy_et_al:LIPIcs:2020:11652,
author = {Corentin Barloy and Nathana{\"e}l Fijalkow and Nathan Lhote and Filip Mazowiecki},
title = {{A Robust Class of Linear Recurrence Sequences}},
booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-132-0},
ISSN = {1868-8969},
year = {2020},
volume = {152},
editor = {Maribel Fern{\'a}ndez and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11652},
URN = {urn:nbn:de:0030-drops-116521},
doi = {10.4230/LIPIcs.CSL.2020.9},
annote = {Keywords: linear recurrence sequences, weighted automata, cost-register automata}
}
|
Keywords: |
|
linear recurrence sequences, weighted automata, cost-register automata |
|
Collection: |
|
28th EACSL Annual Conference on Computer Science Logic (CSL 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
06.01.2020 |
