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

From MaRDI portal

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.