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

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2008 arXiv   pre-print
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.
arXiv:0807.0718v1 fatcat:m66dm5vc2vhfvjqbk3zyvs46wm