Back to Search
Start Over
The Parikh functions of sparse context-free languages are quasi-polynomials
- Publication Year :
- 2008
-
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.
- Subjects :
- Computer Science - Discrete Mathematics
F.4.3
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.0807.0718
- Document Type :
- Working Paper