A characterization of poly-slender context-free languages
RAIRO-Theor. Inf. Appl., 34 1 (2000) 77-86
Published online: 2002-04-15
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):
Dead ends and rationality of complete growth series
Pierre Alderic Bagnoud and Corentin BodartAdvances in Mathematics 452 109821 (2024)
https://doi.org/10.1016/j.aim.2024.109821
On bounded linear codes and the commutative equivalence
Arturo Carpi and Flavio D'AlessandroTheoretical Computer Science 852 185 (2021)
https://doi.org/10.1016/j.tcs.2020.11.031
On the Commutative Equivalence of Algebraic Formal Series and Languages
Arturo Carpi and Flavio D’AlessandroInternational Journal of Foundations of Computer Science 32 (04) 341 (2021)
https://doi.org/10.1142/S0129054121500192
11682 119 (2019)
https://doi.org/10.1007/978-3-030-28796-2_9
Developments in Language Theory
Arturo Carpi and Flavio D’AlessandroLecture Notes in Computer Science, Developments in Language Theory 11088 169 (2018)
https://doi.org/10.1007/978-3-319-98654-8_14
Recognition of poly-slender context-free languages by trellis automata
Véronique TerrierTheoretical Computer Science 692 1 (2017)
https://doi.org/10.1016/j.tcs.2017.05.041
Cellular Automata and Discrete Complex Systems
Véronique TerrierLecture Notes in Computer Science, Cellular Automata and Discrete Complex Systems 9099 251 (2015)
https://doi.org/10.1007/978-3-662-47221-7_19
On the commutative equivalence of bounded context-free and regular languages: The code case
Flavio D'Alessandro and Benedetto IntrigilaTheoretical Computer Science 562 304 (2015)
https://doi.org/10.1016/j.tcs.2014.10.005
FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
PAWEŁ GAWRYCHOWSKI, DALIA KRIEGER, NARAD RAMPERSAD and JEFFREY SHALLITInternational 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
Flavio D’Alessandro, Benedetto Intrigila and Stefano VarricchioTheoretical Computer Science 410 (47-49) 5158 (2009)
https://doi.org/10.1016/j.tcs.2009.09.006
Slender Siromoney matrix languages
Ralf StiebeInformation and Computation 206 (9-10) 1248 (2008)
https://doi.org/10.1016/j.ic.2008.03.024
Developments in Language Theory
Paweł Gawrychowski, Dalia Krieger, Narad Rampersad and Jeffrey ShallitLecture 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
Christian Choffrut, Flavio D’Alessandro and Stefano VarricchioTheoretical Computer Science 381 (1-3) 274 (2007)
https://doi.org/10.1016/j.tcs.2007.04.003
Periodic and Sturmian languages
Lucian Ilie, Solomon Marcus and Ion PetreInformation Processing Letters 98 (6) 242 (2006)
https://doi.org/10.1016/j.ipl.2005.05.029
On the structure of the counting function of sparse context-free languages
Flavio D’Alessandro, Benedetto Intrigila and Stefano VarricchioTheoretical Computer Science 356 (1-2) 104 (2006)
https://doi.org/10.1016/j.tcs.2006.01.037
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 MitranaElectronic Notes in Theoretical Computer Science 53 137 (2004)
https://doi.org/10.1016/S1571-0661(05)82579-4
Theory Is Forever
Alexandru MateescuLecture Notes in Computer Science, Theory Is Forever 3113 170 (2004)
https://doi.org/10.1007/978-3-540-27812-2_16
On universally easy classes for NP-complete problems
Erik D. Demaine, Alejandro López-Ortiz and J.Ian MunroTheoretical Computer Science 304 (1-3) 471 (2003)
https://doi.org/10.1016/S0304-3975(03)00286-X
A sharpening of the Parikh mapping
Alexandru Mateescu, Arto Salomaa, Kai Salomaa and Sheng YuRAIRO - Theoretical Informatics and Applications 35 (6) 551 (2001)
https://doi.org/10.1051/ita:2001131