4 citations · 4 across the 3 of their papers we have counts for
3 papers
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.
cs.DM2006
Well quasi-orders and the shuffle closure of finite sets
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varrichio
Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the pro…