A robust class of linear recurrence sequences
type: Item
instance of: scholarly article
title: A robust class of linear recurrence sequences
author: Corentin Barloy
author: Nathanaël Fijalkow
author: Nathan Lhote
author: Filip Mazowiecki
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1908.03890
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629154
zbMATH Keywords: linear recurrence sequences
zbMATH Keywords: weighted automata
zbMATH Keywords: cost-register automata
MaRDI profile type: Publication
OpenAlex ID: W2968034306
cites work: Q5874194
cites work: On the definition of a family of automata
cites work: Weighted automata and weighted logics
cites work: Quantitative Monadic Second-Order Logic
cites work: Regular Functions and Cost Register Automata
cites work: STACS 2005
cites work: Handbook of weighted automata
cites work: Q3545513
cites work: On the Positivity Problem for Simple Linear Recurrence Sequences,
cites work: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
cites work: Complexity of Restricted Variants of Skolem and Related Problems
cites work: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
cites work: Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
cites work: Probabilistic Automata of Bounded Ambiguity
cites work: Weak cost register automata are still powerful
cites work: Q3644388
cites work: On the degree of ambiguity of finite automata
cites work: Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
cites work: Copyless cost-register automata: structure, expressiveness, and closure properties
cites work: Q4320535
cites work: Q3304149
DOI: 10.1016/J.IC.2022.104964
description: scientific article; zbMATH DE number 7629154