The Parikh functions of sparse context-free languages are quasi-polynomials
classification
💻 cs.DM
keywords
context-freeparikhproveboundedcasefunctionfunctionslanguage
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.