Articles citing this article

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).

Cited article:

This article has been cited by the following article(s):

On universally easy classes for NP-complete problems

Erik D. Demaine, Alejandro López-Ortiz and J.Ian Munro
Theoretical Computer Science 304 (1-3) 471 (2003)
DOI: 10.1016/S0304-3975(03)00286-X
See this article

On the commutative equivalence of bounded context-free and regular languages: The code case

Flavio D'Alessandro and Benedetto Intrigila
Theoretical Computer Science 562 304 (2015)
DOI: 10.1016/j.tcs.2014.10.005
See this article

Slender Siromoney matrix languages

Ralf Stiebe
Information and Computation 206 (9-10) 1248 (2008)
DOI: 10.1016/j.ic.2008.03.024
See this article

Recognition of poly-slender context-free languages by trellis automata

Véronique Terrier
Theoretical Computer Science 692 1 (2017)
DOI: 10.1016/j.tcs.2017.05.041
See this article

Cellular Automata and Discrete Complex Systems

Véronique Terrier
Lecture Notes in Computer Science, Cellular Automata and Discrete Complex Systems 9099 251 (2015)
DOI: 10.1007/978-3-662-47221-7_19
See this article

A sharpening of the Parikh mapping

Alexandru Mateescu, Arto Salomaa, Kai Salomaa and Sheng Yu
RAIRO - Theoretical Informatics and Applications 35 (6) 551 (2001)
DOI: 10.1051/ita:2001131
See this article

Periodic and Sturmian languages

Lucian Ilie, Solomon Marcus and Ion Petre
Information Processing Letters 98 (6) 242 (2006)
DOI: 10.1016/j.ipl.2005.05.029
See this article

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)
DOI: 10.1142/S0129054110007441
See this article

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

Flavio D’Alessandro, Benedetto Intrigila and Stefano Varricchio
Theoretical Computer Science 410 (47-49) 5158 (2009)
DOI: 10.1016/j.tcs.2009.09.006
See this article

On the separability of sparse context-free languages and of bounded rational relations

Christian Choffrut, Flavio D’Alessandro and Stefano Varricchio
Theoretical Computer Science 381 (1-3) 274 (2007)
DOI: 10.1016/j.tcs.2007.04.003
See this article

On the structure of the counting function of sparse context-free languages

Flavio D’Alessandro, Benedetto Intrigila and Stefano Varricchio
Theoretical Computer Science 356 (1-2) 104 (2006)
DOI: 10.1016/j.tcs.2006.01.037
See this article

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

Masami Ito, Carlos Martín-Vide and Victor Mitrana
Electronic Notes in Theoretical Computer Science 53 137 (2004)
DOI: 10.1016/S1571-0661(05)82579-4
See this article

Combinatorics on Words

Arturo Carpi and Flavio D’Alessandro
Lecture Notes in Computer Science, Combinatorics on Words 11682 119 (2019)
DOI: 10.1007/978-3-030-28796-2_9
See this article

Developments in Language Theory

Arturo Carpi and Flavio D’Alessandro
Lecture Notes in Computer Science, Developments in Language Theory 11088 169 (2018)
DOI: 10.1007/978-3-319-98654-8_14
See this article

Developments in Language Theory

Paweł Gawrychowski, Dalia Krieger, Narad Rampersad and Jeffrey Shallit
Lecture Notes in Computer Science, Developments in Language Theory 5257 339 (2008)
DOI: 10.1007/978-3-540-85780-8_27
See this article

Theory Is Forever

Alexandru Mateescu
Lecture Notes in Computer Science, Theory Is Forever 3113 170 (2004)
DOI: 10.1007/978-3-540-27812-2_16
See this article

On bounded linear codes and the commutative equivalence

Arturo Carpi and Flavio D'Alessandro
Theoretical Computer Science 852 185 (2021)
DOI: 10.1016/j.tcs.2020.11.031
See this article