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

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-597966

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.