A robust class of linear recurrence sequences

DOI10.1016/j.ic.2022.104964OpenAlexW2968034306MaRDI QIDQ2105454

Filip Mazowiecki, Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.03890

zbMATH Keywords

weighted automatalinear recurrence sequencescost-register automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Decision Questions for Probabilistic Automata on Small Alphabets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Handbook of weighted automata
• On the degree of ambiguity of finite automata
• Weak cost register automata are still powerful
• Copyless cost-register automata: structure, expressiveness, and closure properties
• Weighted automata and weighted logics
• On the definition of a family of automata
• Complexity of Restricted Variants of Skolem and Related Problems
• Probabilistic Automata of Bounded Ambiguity
• On the Positivity Problem for Simple Linear Recurrence Sequences,
• Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
• Regular Functions and Cost Register Automata
• Quantitative Monadic Second-Order Logic
• Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• STACS 2005

This page was built for publication: A robust class of linear recurrence sequences