The Parikh functions of sparse context-free languages are quasi-polynomials

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/164283We prove that the Parikh map of a bounded context-free language is a box spline. Moreover we prove that in this case, such a function is rational.Discrete MathematicsF.4.3The Parikh functions of sparse context-free languages are quasi-polynomialstext