The Citing articles tool gives a list of articles citing the current article. The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
PAWEŁ GAWRYCHOWSKI, DALIA KRIEGER, NARAD RAMPERSAD and JEFFREY SHALLIT International Journal of Foundations of Computer Science 21(04) 597 (2010) https://doi.org/10.1142/S0129054110007441
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Paweł Gawrychowski, Dalia Krieger, Narad Rampersad and Jeffrey Shallit Lecture Notes in Computer Science, Developments in Language Theory 5257 339 (2008) https://doi.org/10.1007/978-3-540-85780-8_27
On the separability of sparse context-free languages and of bounded rational relations
Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508
Alexandru Mateescu, Arto Salomaa, Kai Salomaa and Sheng Yu RAIRO - Theoretical Informatics and Applications 35(6) 551 (2001) https://doi.org/10.1051/ita:2001131