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

Flavio D Alessandro, Benedetto Intrigila, Stefano Varricchio. The Parikh counting functions of sparse context-free languages are quasi-polynomials. Theoretical Computer Science, 410(47-49):5158-5181, 2009. [doi]

Abstract

Abstract is missing.