@article{DALESSANDRO20095158,
    Abstract = {Let L be a sparse context-free language over an alphabet of t letters and let fL:Nt→N be its Parikh counting function. We prove the following two results: 1.There exists a partition of Nt into a finite family of polyhedra such that the function fL is a quasi-polynomial on each polyhedron of the partition.2.There exists a partition of Nt into a finite family of rational subsets such that the function fL is a polynomial on each set of the partition.},
    Author = {D'Alessandro, Flavio and Intrigila, Benedetto and Varricchio, Stefano},
    File = {The Parikh counting functions of sparse context-free languages are quasi-polynomials - 1-s2.0-S0304397509006331-main - a.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Sparse language, Context-free language, Semi-linear set, Parikh counting function},
    Number = {47},
    Pages = {5158-5181},
    Title = {The Parikh counting functions of sparse context-free languages are quasi-polynomials},
    URL = {https://www.sciencedirect.com/science/article/pii/S0304397509006331},
    Volume = {410},
    Year = {2009},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397509006331},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2009.09.006},
    date-added = {2023-01-08 20:56:45 +0100},
    date-modified = {2023-01-08 20:56:45 +0100},
    doi = {10.1016/j.tcs.2009.09.006}
}

@article{DALESSANDRO20095158, Abstract = {Let L be a sparse context-free language over an alphabet of t letters and let fL:Nt→N be its Parikh counting function. We prove the following two results: 1.There exists a partition of Nt into a finite family of polyhedra such that the function fL is a quasi-polynomial on each polyhedron of the partition.2.There exists a partition of Nt into a finite family of rational subsets such that the function fL is a polynomial on each set of the partition.}, Author = {D'Alessandro, Flavio and Intrigila, Benedetto and Varricchio, Stefano}, File = {The Parikh counting functions of sparse context-free languages are quasi-polynomials - 1-s2.0-S0304397509006331-main - a.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Sparse language, Context-free language, Semi-linear set, Parikh counting function}, Number = {47}, Pages = {5158-5181}, Title = {The Parikh counting functions of sparse context-free languages are quasi-polynomials}, URL = {https://www.sciencedirect.com/science/article/pii/S0304397509006331}, Volume = {410}, Year = {2009}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397509006331}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2009.09.006}, date-added = {2023-01-08 20:56:45 +0100}, date-modified = {2023-01-08 20:56:45 +0100}, doi = {10.1016/j.tcs.2009.09.006} }