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

Developments in Language Theory

Aldo de Luca, Elena V. Pribavkina and Luca Q. Zamboni
Lecture Notes in Computer Science, Developments in Language Theory 7907 191 (2013)
DOI: 10.1007/978-3-642-38771-5_18
See this article

A History of Folding in Mathematics

Michael Friedman
Science Networks. Historical Studies, A History of Folding in Mathematics 59 355 (2018)
DOI: 10.1007/978-3-319-72487-4_6
See this article

On the fixed points of the iterated pseudopalindromic closure operator

D. Jamet, G. Paquin, G. Richomme and L. Vuillon
Theoretical Computer Science 412 (27) 2974 (2011)
DOI: 10.1016/j.tcs.2010.03.018
See this article

Introducing privileged words: Privileged complexity of Sturmian words

Jarkko Peltomäki
Theoretical Computer Science 500 57 (2013)
DOI: 10.1016/j.tcs.2013.05.028
See this article

Further Developments in Fractals and Related Fields

Pierre Arnoux and Štěpán Starosta
Further Developments in Fractals and Related Fields 1 (2013)
DOI: 10.1007/978-0-8176-8400-6_1
See this article

A palindromization map on free monoids

Aldo de Luca
Proceedings of the Steklov Institute of Mathematics 274 (1) 124 (2011)
DOI: 10.1134/S0081543811060095
See this article

Sturmian jungle (or garden?) on multiliteral alphabets

L'ubomíra Balková, Edita Pelantová and Štěpán Starosta
RAIRO - Theoretical Informatics and Applications 44 (4) 443 (2010)
DOI: 10.1051/ita/2011002
See this article

Developments in Language Theory

Srečko Brlek, Nadia Lafrenière and Xavier Provençal
Lecture Notes in Computer Science, Developments in Language Theory 9168 155 (2015)
DOI: 10.1007/978-3-319-21500-6_12
See this article

The finite index basis property

Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.
Journal of Pure and Applied Algebra 219 (7) 2521 (2015)
DOI: 10.1016/j.jpaa.2014.09.014
See this article

On theta-palindromic richness

Štěpán Starosta
Theoretical Computer Science 412 (12-14) 1111 (2011)
DOI: 10.1016/j.tcs.2010.12.011
See this article

A new characteristic property of rich words

Michelangelo Bucci, Alessandro De Luca, Amy Glen and Luca Q. Zamboni
Theoretical Computer Science 410 (30-32) 2860 (2009)
DOI: 10.1016/j.tcs.2008.11.001
See this article

On the structure of bispecial Sturmian words

Gabriele Fici
Journal of Computer and System Sciences 80 (4) 711 (2014)
DOI: 10.1016/j.jcss.2013.11.001
See this article

BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS

VALÉRIE BERTHÉ, JULIEN CASSAIGNE and WOLFGANG STEINER
International Journal of Algebra and Computation 23 (04) 689 (2013)
DOI: 10.1142/S0218196713400043
See this article

A geometric interpretation of the Schützenberger group of a minimal subshift

Jorge Almeida and Alfredo Costa
Arkiv för Matematik 54 (2) 243 (2016)
DOI: 10.1007/s11512-016-0233-7
See this article

On a generalization of Christoffel words: epichristoffel words

Geneviève Paquin
Theoretical Computer Science 410 (38-40) 3782 (2009)
DOI: 10.1016/j.tcs.2009.05.014
See this article

Formal Languages, Automata and Numeration Systems 2

Formal Languages, Automata and Numeration Systems 2 193 (2014)
DOI: 10.1002/9781119042853.biblio
See this article

Standard factors of Sturmian words

Gwénaël Richomme, Kalle Saari and Luca Q. Zamboni
RAIRO - Theoretical Informatics and Applications 44 (1) 159 (2010)
DOI: 10.1051/ita/2010011
See this article

Balance and Abelian complexity of the Tribonacci word

Gwénaël Richomme, Kalle Saari and Luca Q. Zamboni
Advances in Applied Mathematics 45 (2) 212 (2010)
DOI: 10.1016/j.aam.2010.01.006
See this article

Formal Languages, Automata and Numeration Systems 1

Formal Languages, Automata and Numeration Systems 1 257 (2014)
DOI: 10.1002/9781119008200.biblio
See this article

On the number of episturmian palindromes

Michelangelo Bucci, Aldo de Luca and Alessandro De Luca
Theoretical Computer Science 411 (40-42) 3668 (2010)
DOI: 10.1016/j.tcs.2010.06.016
See this article

Bifix codes and Sturmian words

Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer and Giuseppina Rindone
Journal of Algebra 369 146 (2012)
DOI: 10.1016/j.jalgebra.2012.07.013
See this article

Counting distinct palindromes in a word in linear time

Richard Groult, Élise Prieur and Gwénaël Richomme
Information Processing Letters 110 (20) 908 (2010)
DOI: 10.1016/j.ipl.2010.07.018
See this article

Special factors and the combinatorics of suffix and factor automata

Gabriele Fici
Theoretical Computer Science 412 (29) 3604 (2011)
DOI: 10.1016/j.tcs.2011.03.007
See this article

A standard correspondence on epicentral words

Aldo de Luca
European Journal of Combinatorics 33 (7) 1514 (2012)
DOI: 10.1016/j.ejc.2012.03.015
See this article

Combinatorics on Words

Václav Košík and Štěpán Starosta
Lecture Notes in Computer Science, Combinatorics on Words 11682 226 (2019)
DOI: 10.1007/978-3-030-28796-2_18
See this article

Combinatorics on Words

Kateřina Medková
Lecture Notes in Computer Science, Combinatorics on Words 11682 251 (2019)
DOI: 10.1007/978-3-030-28796-2_20
See this article

Rich square-free words

Jetro Vesti
Theoretical Computer Science 687 48 (2017)
DOI: 10.1016/j.tcs.2017.05.003
See this article

Fixed points of Sturmian morphisms and their derivated words

Karel Klouda, Kateřina Medková, Edita Pelantová and Štěpán Starosta
Theoretical Computer Science 743 23 (2018)
DOI: 10.1016/j.tcs.2018.06.037
See this article

Developments in Language Theory

Antonio Restivo and Giovanna Rosone
Lecture Notes in Computer Science, Developments in Language Theory 5583 431 (2009)
DOI: 10.1007/978-3-642-02737-6_35
See this article

Lamination languages

LUIS-MIGUEL LOPEZ and PHILIPPE NARBEL
Ergodic Theory and Dynamical Systems 33 (6) 1813 (2013)
DOI: 10.1017/etds.2012.114
See this article

Maximal bifix decoding

Valérie Berthé, Clelia De Felice, Francesco Dolce, et al.
Discrete Mathematics 338 (5) 725 (2015)
DOI: 10.1016/j.disc.2014.12.010
See this article

Morphic images of episturmian words having finite palindromic defect

Štěpán Starosta
European Journal of Combinatorics 51 359 (2016)
DOI: 10.1016/j.ejc.2015.07.001
See this article

On the group of a rational maximal bifix code

Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou and Dominique Perrin
Forum Mathematicum (2019)
DOI: 10.1515/forum-2018-0270
See this article

Abelian periods of factors of Sturmian words

Jarkko Peltomäki
Journal of Number Theory 214 251 (2020)
DOI: 10.1016/j.jnt.2020.04.007
See this article

On non-repetitive complexity of Arnoux–Rauzy words

Kateřina Medková, Edita Pelantová and Élise Vandomme
Discrete Applied Mathematics 285 423 (2020)
DOI: 10.1016/j.dam.2020.06.016
See this article