Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Paquin, Geneviève
2009.
On a generalization of Christoffel words: epichristoffel words.
Theoretical Computer Science,
Vol. 410,
Issue. 38-40,
p.
3782.
Bucci, Michelangelo
De Luca, Alessandro
Glen, Amy
and
Zamboni, Luca Q.
2009.
A new characteristic property of rich words.
Theoretical Computer Science,
Vol. 410,
Issue. 30-32,
p.
2860.
Restivo, Antonio
and
Rosone, Giovanna
2009.
Developments in Language Theory.
Vol. 5583,
Issue. ,
p.
431.
Bucci, Michelangelo
de Luca, Aldo
and
De Luca, Alessandro
2010.
On the number of episturmian palindromes.
Theoretical Computer Science,
Vol. 411,
Issue. 40-42,
p.
3668.
Richomme, Gwénaël
Saari, Kalle
and
Zamboni, Luca Q.
2010.
Standard factors of Sturmian words.
RAIRO - Theoretical Informatics and Applications,
Vol. 44,
Issue. 1,
p.
159.
Richomme, Gwénaël
Saari, Kalle
and
Zamboni, Luca Q.
2010.
Balance and Abelian complexity of the Tribonacci word.
Advances in Applied Mathematics,
Vol. 45,
Issue. 2,
p.
212.
Groult, Richard
Prieur, Élise
and
Richomme, Gwénaël
2010.
Counting distinct palindromes in a word in linear time.
Information Processing Letters,
Vol. 110,
Issue. 20,
p.
908.
Balková, L'ubomíra
Pelantová, Edita
and
Starosta, Štěpán
2010.
Sturmian jungle (or garden?) on multiliteral alphabets.
RAIRO - Theoretical Informatics and Applications,
Vol. 44,
Issue. 4,
p.
443.
Fici, Gabriele
2011.
Special factors and the combinatorics of suffix and factor automata.
Theoretical Computer Science,
Vol. 412,
Issue. 29,
p.
3604.
Jamet, D.
Paquin, G.
Richomme, G.
and
Vuillon, L.
2011.
On the fixed points of the iterated pseudopalindromic closure operator.
Theoretical Computer Science,
Vol. 412,
Issue. 27,
p.
2974.
Starosta, Štěpán
2011.
On theta-palindromic richness.
Theoretical Computer Science,
Vol. 412,
Issue. 12-14,
p.
1111.
de Luca, Aldo
2011.
A palindromization map on free monoids.
Proceedings of the Steklov Institute of Mathematics,
Vol. 274,
Issue. 1,
p.
124.
de Luca, Aldo
2012.
A standard correspondence on epicentral words.
European Journal of Combinatorics,
Vol. 33,
Issue. 7,
p.
1514.
Berstel, Jean
De Felice, Clelia
Perrin, Dominique
Reutenauer, Christophe
and
Rindone, Giuseppina
2012.
Bifix codes and Sturmian words.
Journal of Algebra,
Vol. 369,
Issue. ,
p.
146.
LOPEZ, LUIS-MIGUEL
and
NARBEL, PHILIPPE
2013.
Lamination languages.
Ergodic Theory and Dynamical Systems,
Vol. 33,
Issue. 6,
p.
1813.
Peltomäki, Jarkko
2013.
Introducing privileged words: Privileged complexity of Sturmian words.
Theoretical Computer Science,
Vol. 500,
Issue. ,
p.
57.
BERTHÉ, VALÉRIE
CASSAIGNE, JULIEN
and
STEINER, WOLFGANG
2013.
BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS.
International Journal of Algebra and Computation,
Vol. 23,
Issue. 04,
p.
689.
Arnoux, Pierre
and
Starosta, Štěpán
2013.
Further Developments in Fractals and Related Fields.
p.
1.
de Luca, Aldo
Pribavkina, Elena V.
and
Zamboni, Luca Q.
2013.
Developments in Language Theory.
Vol. 7907,
Issue. ,
p.
191.
Fici, Gabriele
2014.
On the structure of bispecial Sturmian words.
Journal of Computer and System Sciences,
Vol. 80,
Issue. 4,
p.
711.