The Parikh counting functions of sparse context-free languages are quasi-polynomials
From MaRDI portal
Publication:1034637
DOI10.1016/j.tcs.2009.09.006zbMath1194.68135OpenAlexW1982926034MaRDI QIDQ1034637
Stefano Varricchio, Benedetto Intrigila, Flavio D'Alessandro
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.006
Related Items (7)
On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On bounded linear codes and the commutative equivalence ⋮ On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) ⋮ On the commutative equivalence of bounded context-free and regular languages: the semi-linear case ⋮ Stefano Varricchio (1960-2008) ⋮ Quasi-polynomials, linear Diophantine equations and semi-linear sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vector partition functions and generalized Dahmen and Micchelli spaces
- A decision method for Parikh slenderness of context-free languages
- Analytic models and ambiguity of context-free languages
- Decision problems concerning thinness and slenderness of formal languages
- Length considerations in context-free languages
- Residue formulae for vector partitions and Euler-Maclaurin sums.
- On the structure of the counting function of sparse context-free languages.
- Semigroups, Presburger formulas, and languages
- Rational sets in commutative monoids
- The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
- Convex Polytopes
- A characterization of poly-slender context-free languages
- ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
- The growth function of context-free languages
- On Parikh slender context-free languages
This page was built for publication: The Parikh counting functions of sparse context-free languages are quasi-polynomials
