7 citations · 23 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009★ 4 cited
On some counting problems for semi-linear sets
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
Let be a subset of or . We can associate with a function which returns, for every , the number ${\c…
cs.DM2008
The Parikh functions of sparse context-free languages are quasi-polynomials
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
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.