Comparing Complexity Functions of a Language and Its Extendable Part
RAIRO-Theor. Inf. Appl., 42 3 (2008) 647-655
Published online: 2008-06-03
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):
Avoiding square-free words on free groups
Golnaz Badkobeh, Tero Harju, Pascal Ochem and Matthieu RosenfeldTheoretical Computer Science 922 206 (2022)
https://doi.org/10.1016/j.tcs.2022.04.025
A New Hierarchy for Automaton Semigroups
Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs and Matthieu PicantinInternational Journal of Foundations of Computer Science 31 (08) 1069 (2020)
https://doi.org/10.1142/S0129054120420046
Subword complexity and power avoidance
Jeffrey Shallit and Arseny ShurTheoretical Computer Science 792 96 (2019)
https://doi.org/10.1016/j.tcs.2018.09.010
10977 71 (2018)
https://doi.org/10.1007/978-3-319-94812-6_7
Growth of Power-Free Languages over Large Alphabets
Arseny M. ShurTheory of Computing Systems 54 (2) 224 (2014)
https://doi.org/10.1007/s00224-013-9512-x
Growth properties of power-free languages
Arseny M. ShurComputer Science Review 6 (5-6) 187 (2012)
https://doi.org/10.1016/j.cosrev.2012.09.001
ON PANSIOT WORDS AVOIDING 3-REPETITIONS
IRINA A. GORBUNOVA and ARSENY M. SHURInternational Journal of Foundations of Computer Science 23 (08) 1583 (2012)
https://doi.org/10.1142/S0129054112400631
On Pansiot Words Avoiding 3-Repetitions
Irina A. Gorbunova and Arseny M. ShurElectronic Proceedings in Theoretical Computer Science 63 138 (2011)
https://doi.org/10.4204/EPTCS.63.19
Developments in Language Theory
Arseny M. ShurLecture Notes in Computer Science, Developments in Language Theory 6795 28 (2011)
https://doi.org/10.1007/978-3-642-22321-1_3
On the growth rates of complexity of threshold languages
Arseny M. Shur and Irina A. GorbunovaRAIRO - Theoretical Informatics and Applications 44 (1) 175 (2010)
https://doi.org/10.1051/ita/2010012
Computer Science – Theory and Applications
Arseny M. ShurLecture Notes in Computer Science, Computer Science – Theory and Applications 6072 350 (2010)
https://doi.org/10.1007/978-3-642-13182-0_35
Growth rates of complexity of power-free languages
Arseny M. ShurTheoretical Computer Science 411 (34-36) 3209 (2010)
https://doi.org/10.1016/j.tcs.2010.05.017
Developments in Language Theory
Arseny M. ShurLecture Notes in Computer Science, Developments in Language Theory 5583 466 (2009)
https://doi.org/10.1007/978-3-642-02737-6_38