Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
BERSTEL, JEAN
2002.
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS.
International Journal of Algebra and Computation,
Vol. 12,
Issue. 01n02,
p.
371.
Justin, Jacques
and
Pirillo, Giuseppe
2002.
Episturmian words and episturmian morphisms.
Theoretical Computer Science,
Vol. 276,
Issue. 1-2,
p.
281.
Lenz, Daniel
2003.
Hierarchical structures in Sturmian dynamical systems.
Theoretical Computer Science,
Vol. 303,
Issue. 2-3,
p.
463.
Richomme, Gwenael
2003.
Some algorithms to compute the conjugates of Episturmian morphisms.
RAIRO - Theoretical Informatics and Applications,
Vol. 37,
Issue. 1,
p.
85.
DAMANIK, D.
and
ZAMBONI, LUCA Q.
2003.
COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS.
Reviews in Mathematical Physics,
Vol. 15,
Issue. 07,
p.
745.
Richomme, G.
2003.
Conjugacy and episturmian morphisms.
Theoretical Computer Science,
Vol. 302,
Issue. 1-3,
p.
1.
Araújo, Isabel M.
and
Bruyère, Véronique
2005.
Developments in Language Theory.
Vol. 3572,
Issue. ,
p.
122.
Damanik, David
and
Lenz, Daniel
2006.
Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials.
Journal de Mathématiques Pures et Appliquées,
Vol. 85,
Issue. 5,
p.
671.
Damanik, David
and
Lenz, Daniel
2006.
A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem.
Duke Mathematical Journal,
Vol. 133,
Issue. 1,
Glen, Amy
2006.
Occurrences of palindromes in characteristic Sturmian words.
Theoretical Computer Science,
Vol. 352,
Issue. 1-3,
p.
31.
Richomme, Gwénaël
2007.
Developments in Language Theory.
Vol. 4588,
Issue. ,
p.
371.
Mohammad-Noori, M.
and
Currie, James D.
2007.
Dejean’s conjecture and Sturmian words.
European Journal of Combinatorics,
Vol. 28,
Issue. 3,
p.
876.
Glen, Amy
2007.
Powers in a class of A-strict standard episturmian words.
Theoretical Computer Science,
Vol. 380,
Issue. 3,
p.
330.
Balková, L’ubomíra
Pelantová, Edita
and
Steiner, Wolfgang
2008.
Sequences with constant number of return words.
Monatshefte für Mathematik,
Vol. 155,
Issue. 3-4,
p.
251.
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
2008.
A characterization of fine words over a finite alphabet.
Theoretical Computer Science,
Vol. 391,
Issue. 1-2,
p.
51.
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.
Klouda, Karel
and
Pelantová, Edita
2009.
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers.
INTEG,
Vol. 9,
Issue. 3,
p.
281.
Glen, Amy
Justin, Jacques
Widmer, Steve
and
Zamboni, Luca Q.
2009.
Palindromic richness.
European Journal of Combinatorics,
Vol. 30,
Issue. 2,
p.
510.
Bucci, Michelangelo
de Luca, Aldo
De Luca, Alessandro
and
Zamboni, Luca Q.
2009.
On θ-episturmian words.
European Journal of Combinatorics,
Vol. 30,
Issue. 2,
p.
473.