Sturmian jungle (or garden?) on multiliteral alphabets
RAIRO-Theor. Inf. Appl., 44 4 (2010) 443-470
Published online: 2011-02-28
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):
The asymptotic repetition threshold of sequences rich in palindromes
L’ubomíra Dvořáková, Karel Klouda and Edita PelantováEuropean Journal of Combinatorics 126 104124 (2025)
https://doi.org/10.1016/j.ejc.2025.104124
15729 116 (2025)
https://doi.org/10.1007/978-3-031-97548-6_11
On balanced sequences and their critical exponent
Francesco Dolce, L'ubomíra Dvořáková and Edita PelantováTheoretical Computer Science 939 18 (2023)
https://doi.org/10.1016/j.tcs.2022.10.014
Palindromic factorization of rich words
Josef RukavickaDiscrete Applied Mathematics 316 95 (2022)
https://doi.org/10.1016/j.dam.2022.03.030
Developments in Language Theory
Francesco Dolce and Pierre-Adrien TahayLecture Notes in Computer Science, Developments in Language Theory 13257 127 (2022)
https://doi.org/10.1007/978-3-031-05578-2_10
Language and Automata Theory and Applications
Francesco Dolce, L’ubomíra Dvořáková and Edita PelantováLecture Notes in Computer Science, Language and Automata Theory and Applications 12638 293 (2021)
https://doi.org/10.1007/978-3-030-68195-1_23
On non-repetitive complexity of Arnoux–Rauzy words
Kateřina Medková, Edita Pelantová and Élise VandommeDiscrete Applied Mathematics 285 423 (2020)
https://doi.org/10.1016/j.dam.2020.06.016
Fixed points of Sturmian morphisms and their derivated words
Karel Klouda, Kateřina Medková, Edita Pelantová and Štěpán StarostaTheoretical Computer Science 743 23 (2018)
https://doi.org/10.1016/j.tcs.2018.06.037
Developments in Language Theory
Josef RukavickaLecture Notes in Computer Science, Developments in Language Theory 10396 345 (2017)
https://doi.org/10.1007/978-3-319-62809-7_26
On the Zero Defect Conjecture
Sébastien Labbé, Edita Pelantová and Štěpán StarostaEuropean Journal of Combinatorics 62 132 (2017)
https://doi.org/10.1016/j.ejc.2016.12.006
Morphic images of episturmian words having finite palindromic defect
Štěpán StarostaEuropean Journal of Combinatorics 51 359 (2016)
https://doi.org/10.1016/j.ejc.2015.07.001
Palindromic richness for languages invariant under more symmetries
Edita Pelantová and Štěpán StarostaTheoretical Computer Science 518 42 (2014)
https://doi.org/10.1016/j.tcs.2013.07.021
Combinatorics on Words
Vincent Delecroix, Tomáš Hejda and Wolfgang SteinerLecture Notes in Computer Science, Combinatorics on Words 8079 119 (2013)
https://doi.org/10.1007/978-3-642-40579-2_14
ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
EDITA PELANTOVÁ and ŠTÉPÁN STAROSTAInternational Journal of Foundations of Computer Science 23 (05) 1067 (2012)
https://doi.org/10.1142/S012905411240045X
Infinite words with finite defect
Lʼubomíra Balková, Edita Pelantová and Štěpán StarostaAdvances in Applied Mathematics 47 (3) 562 (2011)
https://doi.org/10.1016/j.aam.2010.11.006