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

Flavio D'Alessandro; Benedetto Intrigila; Stefano Varricchio

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

Discrete Mathematics 2008-07-08 v1

Authors: Flavio D'Alessandro , Benedetto Intrigila , Stefano Varricchio

Abstract

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.

Cite

@article{arxiv.0807.0718,
  title  = {The Parikh functions of sparse context-free languages are quasi-polynomials},
  author = {Flavio D'Alessandro and Benedetto Intrigila and Stefano Varricchio},
  journal= {arXiv preprint arXiv:0807.0718},
  year   = {2008}
}