On polynomial recursive sequences

DOI10.4230/LIPICS.ICALP.2020.117MaRDI QIDQ6842453zbMATH OpenFDO

Authors Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michał Pilipczuk, Géraud Sénizergues

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.117

zbMATH Keywords

expressive powerhigher-order pushdown automatarecursive sequencesweighted automata

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Copyless cost-register automata: structure, expressiveness, and closure properties
• Expressiveness of streaming string transducers
• Extending Parikh's theorem to weighted and probabilistic context-free grammars
• Handbook of weighted automata
• scientific article; zbMATH DE number 7650822 (Why is no real title available?)
• Iterated pushdown automata and sequences of rational numbers
• On some non-holonomic sequences
• Polynomial automata: zeroness and applications
• Prime and prime power divisibility of Catalan numbers
• Quantitative Monadic Second-Order Logic
• Regular functions and cost register automata (invited paper)
• Sequences of Level 1, 2, 3,..., k,...
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• The Parikh Property for Weighted Context-Free Grammars
• Weighted automata and weighted logics
• What's decidable about weighted automata?
• Word-mappings of level 2

Cited in

(2)

• Bidimensional linear recursive sequences and universality of unambiguous register automata
• Comparison-free polyregular functions

This page was built for publication: On polynomial recursive sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842453)