Can I read The Parikh counting functions of sparse context-free languages are quasi-polynomials on EtoBox?

The Parikh counting functions of sparse context-free languages are quasi-polynomials by Flavio D’Alessandro; Benedetto Intrigila; Stefano Varricchio is a Computer Science article available to read on EtoBox.

What is The Parikh counting functions of sparse context-free languages are quasi-polynomials about?

Let L be a sparse context-free language over an alphabet of t letters and let f L : N t → N be its Parikh counting function. We prove the following two results: 1. There exists a partition of N t into a finite family of polyhedra such that the function f L is a quasi-polynomial on each polyhedron of the partition. 2. There exists a partition of N t into a finite family of rational subsets such that the function f L is a polynomial on each set of the partition.

Who reads The Parikh counting functions of sparse context-free languages are quasi-polynomials?

Author

Flavio D’Alessandro; Benedetto Intrigila; Stefano Varricchio

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)

Published

2009

Language

EN

Field

Computer Science (Physical Sciences)