The Parikh functions of sparse context-free languages are   quasi-polynomials
  We 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. 
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio