On a class of languages with holonomic generating functions
From MaRDI portal
Publication:728269
DOI10.1016/j.tcs.2016.07.022zbMath1355.68153OpenAlexW2504761087MaRDI QIDQ728269
Paolo Massazza, Giuseppa Castiglione
Publication date: 19 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.022
Related Items (3)
On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) ⋮ On counting functions and slenderness of languages ⋮ Insertion operations on deterministic reversal-bounded counter machines
Uses Software
Cites Work
- Total dual integrality and integer polyhedra
- D-finite power series
- Analytic models and ambiguity of context-free languages
- Differentiably finite power series
- A holonomic systems approach to special functions identities
- Reversal-bounded multipushdown machines
- On the enumeration and generation of generalized Dyck words
- The analytic continuation of generalized functions with respect to a parameter
- An extension of Zeilberger's fast algorithm to general holonomic functions
- Modules over a ring of differential operators. Study of the fundamental solutions of equations with constant coefficients
- On computing the coefficients of bivariate holonomic formal series
- HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- GFUN
- Affine Parikh automata
- Analytic aspects of the shuffle product
- Holonomic functions and their relation to linearly constrained languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On a class of languages with holonomic generating functions
