Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Harju, T.
and
Nowotka, D.
2003.
Developments in Language Theory.
Vol. 2710,
Issue. ,
p.
316.
Harju, Tero
and
Nowotka, Dirk
2004.
STACS 2004.
Vol. 2996,
Issue. ,
p.
294.
HARJU, TERO
and
NOWOTKA, DIRK
2004.
MINIMAL DUVAL EXTENSIONS.
International Journal of Foundations of Computer Science,
Vol. 15,
Issue. 02,
p.
349.
Epifanio, Chiara
and
Mignosi, Filippo
2005.
A multidimensional critical factorization theorem.
Theoretical Computer Science,
Vol. 346,
Issue. 2-3,
p.
265.
de Luca, Aldo
and
De Luca, Alessandro
2006.
Some characterizations of finite Sturmian words.
Theoretical Computer Science,
Vol. 356,
Issue. 1-2,
p.
118.
Harju, Tero
and
Nowotka, Dirk
2007.
Periodicity and unbordered words.
Journal of the ACM,
Vol. 54,
Issue. 4,
p.
20.
Holub, Štěpán
and
Nowotka, Dirk
2008.
Developments in Language Theory.
Vol. 5257,
Issue. ,
p.
408.
Duval, J.-P.
Harju, T.
and
Nowotka, D.
2008.
Unbordered factors and Lyndon words.
Discrete Mathematics,
Vol. 308,
Issue. 11,
p.
2261.
Currie, James D.
and
Saari, Kalle
2009.
Least Periods of Factors of Infinite Words.
RAIRO - Theoretical Informatics and Applications,
Vol. 43,
Issue. 1,
p.
165.
Holub, Štěpán
and
Nowotka, Dirk
2009.
Automata, Languages and Programming.
Vol. 5555,
Issue. ,
p.
537.
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.
HOLUB, ŠTĚPÁN
and
NOWOTKA, DIRK
2010.
ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS.
International Journal of Foundations of Computer Science,
Vol. 21,
Issue. 04,
p.
633.
Holub, Štěpán
and
Nowotka, Dirk
2012.
The Ehrenfeucht–Silberger problem.
Journal of Combinatorial Theory, Series A,
Vol. 119,
Issue. 3,
p.
668.
Reutenauer, Christophe
2015.
Studies on finite Sturmian words.
Theoretical Computer Science,
Vol. 591,
Issue. ,
p.
106.