A Note on a Conjecture of Duval and Sturmian Words
RAIRO-Theor. Inf. Appl., 36 1 (2002) 1-3
Published online: 2002-12-15
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):
Studies on finite Sturmian words
Christophe ReutenauerTheoretical Computer Science 591 106 (2015)
https://doi.org/10.1016/j.tcs.2015.05.003
The Ehrenfeucht–Silberger problem
Štěpán Holub and Dirk NowotkaJournal of Combinatorial Theory, Series A 119 (3) 668 (2012)
https://doi.org/10.1016/j.jcta.2011.11.004
ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS
ŠTĚPÁN HOLUB and DIRK NOWOTKAInternational Journal of Foundations of Computer Science 21 (04) 633 (2010)
https://doi.org/10.1142/S0129054110007465
Standard factors of Sturmian words
Gwénaël Richomme, Kalle Saari and Luca Q. ZamboniRAIRO - Theoretical Informatics and Applications 44 (1) 159 (2010)
https://doi.org/10.1051/ita/2010011
Automata, Languages and Programming
Štěpán Holub and Dirk NowotkaLecture Notes in Computer Science, Automata, Languages and Programming 5555 537 (2009)
https://doi.org/10.1007/978-3-642-02927-1_45
Least Periods of Factors of Infinite Words
James D. Currie and Kalle SaariRAIRO - Theoretical Informatics and Applications 43 (1) 165 (2009)
https://doi.org/10.1051/ita:2008006
Developments in Language Theory
Štěpán Holub and Dirk NowotkaLecture Notes in Computer Science, Developments in Language Theory 5257 408 (2008)
https://doi.org/10.1007/978-3-540-85780-8_32
Unbordered factors and Lyndon words
J.-P. Duval, T. Harju and D. NowotkaDiscrete Mathematics 308 (11) 2261 (2008)
https://doi.org/10.1016/j.disc.2006.09.054
Periodicity and unbordered words
Tero Harju and Dirk NowotkaJournal of the ACM 54 (4) 20 (2007)
https://doi.org/10.1145/1255443.1255448
Some characterizations of finite Sturmian words
Aldo de Luca and Alessandro De LucaTheoretical Computer Science 356 (1-2) 118 (2006)
https://doi.org/10.1016/j.tcs.2006.01.036
A multidimensional critical factorization theorem
Chiara Epifanio and Filippo MignosiTheoretical Computer Science 346 (2-3) 265 (2005)
https://doi.org/10.1016/j.tcs.2005.08.012
MINIMAL DUVAL EXTENSIONS
TERO HARJU and DIRK NOWOTKAInternational Journal of Foundations of Computer Science 15 (02) 349 (2004)
https://doi.org/10.1142/S0129054104002467
STACS 2004
Tero Harju and Dirk NowotkaLecture Notes in Computer Science, STACS 2004 2996 294 (2004)
https://doi.org/10.1007/978-3-540-24749-4_26
Developments in Language Theory
T. Harju and D. NowotkaLecture Notes in Computer Science, Developments in Language Theory 2710 316 (2003)
https://doi.org/10.1007/3-540-45007-6_25