Holonomic functions and their relation to linearly constrained languages
From MaRDI portal
Publication:5286061
DOI10.1051/ita/1993270201491zbMath0781.68079OpenAlexW151521004MaRDI QIDQ5286061
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
generating functionsregular languagesunambiguous context-free languagesChomsky-Schützenberger Theoremlinearly constrained languages
Related Items (6)
Equations in virtually abelian groups: Languages and growth ⋮ On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\) ⋮ Geodesic growth in virtually abelian groups ⋮ On counting functions and slenderness of languages ⋮ On a class of languages with holonomic generating functions ⋮ Analytic analysis of algorithms
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
This page was built for publication: Holonomic functions and their relation to linearly constrained languages
