On polynomial recursive sequences
type: Item
instance of: scholarly article
title: On polynomial recursive sequences
author: Michaël Cadilhac
author: Filip Mazowiecki
author: Charles Paperman
author: Michał Pilipczuk
author: Géraud Sénizergues
published in: Theory of Computing Systems
publication date: 2024-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 11Bxx
Mathematics Subject Classification ID: 03Bxx
zbMATH DE Number: 7922387
zbMATH Keywords: recursive sequences
zbMATH Keywords: expressive power
zbMATH Keywords: weighted automata
zbMATH Keywords: higher-order pushdown automata
MaRDI profile type: Publication
cites work: What’s Decidable about Weighted Automata?
cites work: Prime and prime power divisibility of Catalan numbers
cites work: Expressiveness of streaming string transducers
cites work: Regular Functions and Cost Register Automata
cites work: Q5874194
cites work: Q5144648
cites work: Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars
cites work: Weighted automata and weighted logics
cites work: Handbook of weighted automata
cites work: Word-mappings of level 2
cites work: Iterated pushdown automata and sequences of rational numbers
cites work: The Parikh Property for Weighted Context-Free Grammars
cites work: On some non-holonomic sequences
cites work: The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
cites work: Quantitative Monadic Second-Order Logic
cites work: Q2770573
cites work: Copyless cost-register automata: structure, expressiveness, and closure properties
cites work: Sequences of Level 1, 2, 3,..., k,...
DOI: 10.1007/S00224-021-10046-9
description: scientific article; zbMATH DE number 7922387