On Abelian repetition threshold
RAIRO-Theor. Inf. Appl., 46 1 (2012) 147-163
Published online: 2011-11-14
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):
Non-Constructive Upper Bounds for Repetition Thresholds
Arseny M. ShurTheory of Computing Systems 68 (6) 1487 (2024)
https://doi.org/10.1007/s00224-024-10187-7
Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers
James Currie, Lucas Mol, Narad Rampersad and Jeffrey ShallitSIAM Journal on Discrete Mathematics 38 (4) 2913 (2024)
https://doi.org/10.1137/23M1558513
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2
James D. Currie and Narad RampersadRAIRO - Theoretical Informatics and Applications 58 14 (2024)
https://doi.org/10.1051/ita/2024011
Abelian combinatorics on words: A survey
Gabriele Fici and Svetlana PuzyninaComputer Science Review 47 100532 (2023)
https://doi.org/10.1016/j.cosrev.2022.100532
Computer Science – Theory and Applications
Elena A. Petrova and Arseny M. ShurLecture Notes in Computer Science, Computer Science – Theory and Applications 13296 302 (2022)
https://doi.org/10.1007/978-3-031-09574-0_19
On minimal critical exponent of balanced sequences
L'ubomíra Dvořáková, Edita Pelantová, Daniela Opočenská and Arseny M. ShurTheoretical Computer Science 922 158 (2022)
https://doi.org/10.1016/j.tcs.2022.04.021
The undirected repetition threshold and undirected pattern avoidance
James D. Currie and Lucas MolTheoretical Computer Science 866 56 (2021)
https://doi.org/10.1016/j.tcs.2021.03.010
Developments in Language Theory
Elena A. Petrova and Arseny M. ShurLecture Notes in Computer Science, Developments in Language Theory 12811 328 (2021)
https://doi.org/10.1007/978-3-030-81508-0_27
Abelian periods of factors of Sturmian words
Jarkko PeltomäkiJournal of Number Theory 214 251 (2020)
https://doi.org/10.1016/j.jnt.2020.04.007
Avoiding abelian powers cyclically
Jarkko Peltomäki and Markus A. WhitelandAdvances in Applied Mathematics 121 102095 (2020)
https://doi.org/10.1016/j.aam.2020.102095
11682 145 (2019)
https://doi.org/10.1007/978-3-030-28796-2_11
Abelian powers and repetitions in Sturmian words
Gabriele Fici, Alessio Langiu, Thierry Lecroq, et al.Theoretical Computer Science 635 16 (2016)
https://doi.org/10.1016/j.tcs.2016.04.039
Weak Abelian Periodicity of Infinite Words
Sergey Avgustinovich and Svetlana PuzyninaTheory of Computing Systems 59 (2) 161 (2016)
https://doi.org/10.1007/s00224-015-9629-1
Fault diagnosis for the landing phase of the aircraft based on an adaptive kernel principal component analysis algorithm
Runxia Guo, Kai Guo and Jiankang DongProceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering 229 (10) 917 (2015)
https://doi.org/10.1177/0959651815601276
Developments in Language Theory
Gabriele Fici, Alessio Langiu, Thierry Lecroq, et al.Lecture Notes in Computer Science, Developments in Language Theory 7907 227 (2013)
https://doi.org/10.1007/978-3-642-38771-5_21
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