Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Jenkinson, Oliver
and
Zamboni, Luca Q.
2004.
Characterisations of balanced words via orderings.
Theoretical Computer Science,
Vol. 310,
Issue. 1-3,
p.
247.
Pirillo, Giuseppe
2005.
Inequalities characterizing standard Sturmian and episturmian words.
Theoretical Computer Science,
Vol. 341,
Issue. 1-3,
p.
276.
Berstel, Jean
2007.
Algebraic Informatics.
Vol. 4728,
Issue. ,
p.
23.
Glen, Amy
2007.
Powers in a class of A-strict standard episturmian words.
Theoretical Computer Science,
Vol. 380,
Issue. 3,
p.
330.
Richomme, G.
2007.
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words.
Theoretical Computer Science,
Vol. 380,
Issue. 3,
p.
393.
Glen, Amy
Levé, Florence
and
Richomme, Gwénaël
2008.
Quasiperiodic and Lyndon episturmian words.
Theoretical Computer Science,
Vol. 409,
Issue. 3,
p.
578.
Glen, Amy
Justin, Jacques
and
Pirillo, Giuseppe
2008.
Characterizations of finite and infinite episturmian words via lexicographic orderings.
European Journal of Combinatorics,
Vol. 29,
Issue. 1,
p.
45.
Glen, Amy
2008.
A characterization of fine words over a finite alphabet.
Theoretical Computer Science,
Vol. 391,
Issue. 1-2,
p.
51.
Bernat, Julien
2008.
Study of irreducible balanced pairs for substitutive languages.
RAIRO - Theoretical Informatics and Applications,
Vol. 42,
Issue. 4,
p.
663.
Glen, Amy
and
Justin, Jacques
2009.
Episturmian words: a survey.
RAIRO - Theoretical Informatics and Applications,
Vol. 43,
Issue. 3,
p.
403.
Glen, Amy
Levé, Florence
and
Richomme, Gwénaël
2009.
Directive words of episturmian words: equivalences and normalization.
RAIRO - Theoretical Informatics and Applications,
Vol. 43,
Issue. 2,
p.
299.
Ghareghani, N.
Mohammad-Noori, M.
and
Sharifani, P.
2011.
On z-factorization and c-factorization of standard episturmian words.
Theoretical Computer Science,
Vol. 412,
Issue. 39,
p.
5232.