HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES

DOI10.1142/S0129054192000127MaRDI QIDQ4020487zbMATH OpenOpenAlexFDO

Authors P. Massazza, Alberto Bertoni, N. 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

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

Recommendations

• Holonomic functions and their relation to linearly constrained languages
• On the equivalence problem of context-free and DT0L languages
• scientific article; zbMATH DE number 871232
• On a class of languages with holonomic generating functions
• Analytic models and ambiguity of context-free languages

Cited in

(11)

• On the equivalence problem of context-free and DT0L languages
• Context-freeness of parsing expression languages is undecidable
• Holonomic functions and their relation to linearly constrained languages
• On a class of languages with holonomic generating functions
• From indexed grammars to generating functions
• Rational indexes of generators of the cone of context-free languages
• On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\)
• GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM
• scientific article; zbMATH DE number 3997177 (Why is no real title available?)
• A mechanisation of some context-free language theory in HOL4
• Preface

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

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