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

Simple item page
dc.creatorD'Alessandro, Flavio
dc.creatorIntrigila, Benedetto
dc.creatorVarricchio, Stefano
dc.date2008-07-04
dc.date.accessioned2026-07-07T09:48:37Z
dc.date.available2026-07-07T09:48:37Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0807.0718
dc.identifierhttp://arxiv.org/abs/0807.0718
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164283
dc.subjectDiscrete Mathematics
dc.subjectF.4.3
dc.titleThe Parikh functions of sparse context-free languages are quasi-polynomials
dc.typetext

Files

Collections

arXiv