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

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

2008-07-04

arxiv.org/abs/0807.0718v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Parikh functions of sparse context-free languages are quasi-polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Parikh functions of sparse context-free languages are quasi-polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Parikh functions of sparse context-free languages are quasi-polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-597966