Holonomic functions and their relation to linearly constrained languages

DOI10.1051/ita/1993270201491zbMath0781.68079MaRDI QIDQ5286061

Paolo Massazza

Publication date: 29 June 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92443

zbMATH Keywords

generating functions; regular languages; unambiguous context-free languages; Chomsky-Schützenberger Theorem; linearly constrained languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• D-finite power series
• Counting problems and algebraic formal power series in noncommuting variables
• Resurrecting the asymptotics of linear recurrences
• Analytic models and ambiguity of context-free languages
• Efficient solution of linear diophantine equations
• Differentiably finite power series
• A holonomic systems approach to special functions identities
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• The analytic continuation of generalized functions with respect to a parameter
• Rational sets in commutative monoids
• Modules over a ring of differential operators. Study of the fundamental solutions of equations with constant coefficients
• HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES