A representation theorem for (\(q\)-)holonomic sequences

DOI10.1016/j.jcss.2013.05.004zbMath1295.68147OpenAlexW2004116755MaRDI QIDQ386034

Johann A. Makowsky, Tomer Kotek

Publication date: 13 December 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.05.004

zbMATH Keywords

monadic second-order logicregular languages\(q\)-holonomic sequenesholonomic sequenciespositional weights on wordssparse regular languages

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45) Other combinatorial number theory (11B75) Automata and formal grammars in connection with logical questions (03D05) Special sequences and polynomials (11B83)

Uses Software

• PSI-BLAST
• BLAST
• NAIVE
• DAVID_IAN
• JODO
• BLANKS
• SYMGJ
• SPGJ
• GJseries
• GJSAW
• GJsqfree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Differentiably finite power series
• A holonomic systems approach to special functions identities
• \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
• On Zeilberger's algorithm and its \(q\)-analogue
• On some non-holonomic sequences
• On the structure of the counting function of sparse context-free languages.
• On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
• A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths
• Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
• Strings of Congruent Primes
• The Goulden—Jackson cluster method: extensions, applications and implementations