HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES

DOI10.1142/S0129054192000127zbMath0754.68064OpenAlexW2044911374MaRDI QIDQ4020487

Paolo Massazza, Alberto Bertoni, Nicoletta Sabadini

Publication date: 16 January 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054192000127

zbMATH Keywords

differential equationsdecidabilityTuring equivalenceholonomic generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45)

Related Items (4)

Holonomic functions and their relation to linearly constrained languages ⋮ On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) ⋮ Preface ⋮ On a class of languages with holonomic generating functions

This page was built for publication: HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES