The Parikh functions of sparse context-free languages are quasi-polynomials
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
TL;DR
This paper proves that the Parikh map of bounded context-free languages is a box spline and that such functions are rational, revealing new structural properties of these languages.
Contribution
It establishes that the Parikh map of bounded context-free languages is a box spline and rational, advancing understanding of their combinatorial and algebraic structure.
Findings
Parikh map of bounded context-free languages is a box spline.
Such Parikh functions are rational.
Provides new insights into the structure of these languages.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · DNA and Biological Computing