On a paper by Castelli, Mignosi, Restivo
RAIRO-Theor. Inf. Appl., 34 5 (2000) 373-377
Published online: 2002-04-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):
Obstructions to Return Preservation for Episturmian Morphisms
Valérie Berthé and Herman Goulet-OuelletTheory of Computing Systems 68 (6) 1512 (2024)
https://doi.org/10.1007/s00224-024-10190-y
A periodicity lemma for partial words
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz WaleńInformation and Computation 283 104677 (2022)
https://doi.org/10.1016/j.ic.2020.104677
String periods in the order-preserving model
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny Shur and Tomasz WaleńInformation and Computation 270 104463 (2020)
https://doi.org/10.1016/j.ic.2019.104463
A History of Folding in Mathematics
Michael FriedmanScience Networks. Historical Studies, A History of Folding in Mathematics 59 355 (2018)
https://doi.org/10.1007/978-3-319-72487-4_6
Language and Automata Theory and Applications
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz WaleńLecture Notes in Computer Science, Language and Automata Theory and Applications 10792 232 (2018)
https://doi.org/10.1007/978-3-319-77313-1_18
Generalized pattern matching and periodicity under substring consistent equivalence relations
Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai and Masayuki TakedaTheoretical Computer Science 656 225 (2016)
https://doi.org/10.1016/j.tcs.2016.02.017
Sturmian words and the Stern sequence
Aldo de Luca and Alessandro De LucaTheoretical Computer Science 581 26 (2015)
https://doi.org/10.1016/j.tcs.2015.02.043
Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
Francine Blanchet-Sadri, Sean Simmons, Amelia Tebbe and Amy VeprauskasRAIRO - Theoretical Informatics and Applications 47 (3) 215 (2013)
https://doi.org/10.1051/ita/2013034
Developments in Language Theory
Alexandre Blondin Massé, Sébastien Gaboury and Sylvain HalléLecture Notes in Computer Science, Developments in Language Theory 7410 308 (2012)
https://doi.org/10.1007/978-3-642-31653-1_28
A palindromization map on free monoids
Aldo de LucaProceedings of the Steklov Institute of Mathematics 274 (1) 124 (2011)
https://doi.org/10.1134/S0081543811060095
On graphs of central episturmian words
Aldo de Luca and Luca Q. ZamboniTheoretical Computer Science 411 (1) 70 (2010)
https://doi.org/10.1016/j.tcs.2009.09.003
Episturmian words: a survey
Amy Glen and Jacques JustinRAIRO - Theoretical Informatics and Applications 43 (3) 403 (2009)
https://doi.org/10.1051/ita/2009003
Fine and Wilf words for any periods II
R. Tijdeman and L.Q. ZamboniTheoretical Computer Science 410 (30-32) 3027 (2009)
https://doi.org/10.1016/j.tcs.2009.02.004
On a generalization of Christoffel words: epichristoffel words
Geneviève PaquinTheoretical Computer Science 410 (38-40) 3782 (2009)
https://doi.org/10.1016/j.tcs.2009.05.014
On θ-episturmian words
Michelangelo Bucci, Aldo de Luca, Alessandro De Luca and Luca Q. ZamboniEuropean Journal of Combinatorics 30 (2) 473 (2009)
https://doi.org/10.1016/j.ejc.2008.04.010
Periodicity properties on partial words
F. Blanchet-Sadri, Kevin Corcoran and Jenell NybergInformation and Computation 206 (9-10) 1057 (2008)
https://doi.org/10.1016/j.ic.2008.03.007
Graph connectivity, partial words, and a theorem of Fine and Wilf
F. Blanchet-Sadri, Deepak Bal and Gautam SisodiaInformation and Computation 206 (5) 676 (2008)
https://doi.org/10.1016/j.ic.2007.11.007
More Sets, Graphs and Numbers
Rob TijdemanBolyai Society Mathematical Studies, More Sets, Graphs and Numbers 15 381 (2006)
https://doi.org/10.1007/978-3-540-32439-3_18
Pseudopalindrome closure operators in free monoids
Aldo de Luca and Alessandro De LucaTheoretical Computer Science 362 (1-3) 282 (2006)
https://doi.org/10.1016/j.tcs.2006.07.009
On multiperiodic words
Štěpán HolubRAIRO - Theoretical Informatics and Applications 40 (4) 583 (2006)
https://doi.org/10.1051/ita:2006042
Episturmian morphisms and a Galois theorem on continued fractions
Jacques JustinRAIRO - Theoretical Informatics and Applications 39 (1) 207 (2005)
https://doi.org/10.1051/ita:2005012
Generalised fine and Wilf's theorem for arbitrary number of periods
Sorin Constantinescu and Lucian IlieTheoretical Computer Science 339 (1) 49 (2005)
https://doi.org/10.1016/j.tcs.2005.01.007
Conjugacy and episturmian morphisms
G. RichommeTheoretical Computer Science 302 (1-3) 1 (2003)
https://doi.org/10.1016/S0304-3975(02)00726-0
Some algorithms to compute the conjugates of Episturmian morphisms
Gwenael RichommeRAIRO - Theoretical Informatics and Applications 37 (1) 85 (2003)
https://doi.org/10.1051/ita:2003009
Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
R. Simpson and R. TijdemanProceedings of the American Mathematical Society 131 (6) 1661 (2003)
https://doi.org/10.1090/S0002-9939-03-06970-3
Fine and Wilf words for any periods
R. Tijdeman and L. ZamboniIndagationes Mathematicae 14 (1) 135 (2003)
https://doi.org/10.1016/S0019-3577(03)90076-0
Periodicity, morphisms, and matrices
Sabin Cautis, Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang and Soroosh YazdaniTheoretical Computer Science 295 (1-3) 107 (2003)
https://doi.org/10.1016/S0304-3975(02)00398-5
Episturmian words and episturmian morphisms
Jacques Justin and Giuseppe PirilloTheoretical Computer Science 276 (1-2) 281 (2002)
https://doi.org/10.1016/S0304-3975(01)00207-9
On a characteristic property of ARNOUX–RAUZY sequences
Jacques Justin and Giuseppe PirilloRAIRO - Theoretical Informatics and Applications 36 (4) 385 (2002)
https://doi.org/10.1051/ita:2003005
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
JEAN BERSTELInternational Journal of Algebra and Computation 12 (01n02) 371 (2002)
https://doi.org/10.1142/S021819670200095X
Mathematical Foundations of Computer Science 2001
Filippo Mignosi, Jeffrey Shallit and Ming-wei WangLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2001 2136 512 (2001)
https://doi.org/10.1007/3-540-44683-4_45