On Christoffel classes
RAIRO-Theor. Inf. Appl., 40 1 (2006) 15-27
Published online: 2005-10-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):
15729 91 (2025)
https://doi.org/10.1007/978-3-031-97548-6_9
On the number of equal-letter runs of the bijective Burrows-Wheeler transform
Elena Biagi, Davide Cenzato, Zsuzsanna Lipták and Giuseppe RomanaTheoretical Computer Science 1027 115004 (2025)
https://doi.org/10.1016/j.tcs.2024.115004
On arithmetically progressed suffix arrays and related Burrows–Wheeler transforms
Jacqueline W. Daykin, Dominik Köppl, David Kübel and Florian StoberDiscrete Applied Mathematics 355 180 (2024)
https://doi.org/10.1016/j.dam.2024.04.009
Some results on digital segments and balanced words
Alessandro De Luca and Gabriele FiciTheoretical Computer Science 1021 114935 (2024)
https://doi.org/10.1016/j.tcs.2024.114935
A Symmetry Property of Christoffel Words
Yan Lanciault and Christophe ReutenauerElectronic Proceedings in Theoretical Computer Science 403 123 (2024)
https://doi.org/10.4204/EPTCS.403.26
Lissajous 3-braids
Eiko KIN, Hiroaki NAKAMURA and Hiroyuki OGAWAJournal of the Mathematical Society of Japan 75 (1) (2023)
https://doi.org/10.2969/jmsj/86658665
Developments in Language Theory
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, et al.Lecture Notes in Computer Science, Developments in Language Theory 13911 86 (2023)
https://doi.org/10.1007/978-3-031-33264-7_8
A combinatorial view on string attractors
Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone and Marinella SciortinoTheoretical Computer Science 850 236 (2021)
https://doi.org/10.1016/j.tcs.2020.11.006
A characterization of Sturmian sequences by indistinguishable asymptotic pairs
Sebastián Barbieri, Sébastien Labbé and Štěpán StarostaEuropean Journal of Combinatorics 95 103318 (2021)
https://doi.org/10.1016/j.ejc.2021.103318
SOFSEM 2021: Theory and Practice of Computer Science
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, et al.Lecture Notes in Computer Science, SOFSEM 2021: Theory and Practice of Computer Science 12607 249 (2021)
https://doi.org/10.1007/978-3-030-67731-2_18
Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
Norman Carey and David ClampittJournal of Mathematics and Music 12 (3) 154 (2018)
https://doi.org/10.1080/17459737.2018.1519861
Partitioned factors in Christoffel and Sturmian words
Norman Carey and David ClampittTheoretical Computer Science 743 53 (2018)
https://doi.org/10.1016/j.tcs.2018.06.019
Combinatorics on Words
Mélodie LapointeLecture Notes in Computer Science, Combinatorics on Words 10432 109 (2017)
https://doi.org/10.1007/978-3-319-66396-8_11
Cyclic complexity of words
Julien Cassaigne, Gabriele Fici, Marinella Sciortino and Luca Q. ZamboniJournal of Combinatorial Theory, Series A 145 36 (2017)
https://doi.org/10.1016/j.jcta.2016.07.002
Combinatorics on Words
J. -P. BorelLecture Notes in Computer Science, Combinatorics on Words 10432 177 (2017)
https://doi.org/10.1007/978-3-319-66396-8_17
On a group theoretic generalization of the Morse-Hedlund theorem
Émilie Charlier, Svetlana Puzynina and Luca ZamboniProceedings of the American Mathematical Society 145 (8) 3381 (2017)
https://doi.org/10.1090/proc/13589
Studies on finite Sturmian words
Christophe ReutenauerTheoretical Computer Science 591 106 (2015)
https://doi.org/10.1016/j.tcs.2015.05.003
A $$d$$ d -dimensional Extension of Christoffel Words
Sébastien Labbé and Christophe ReutenauerDiscrete & Computational Geometry 54 (1) 152 (2015)
https://doi.org/10.1007/s00454-015-9681-2
Standard Sturmian words and automata minimization algorithms
G. Castiglione and M. SciortinoTheoretical Computer Science 601 58 (2015)
https://doi.org/10.1016/j.tcs.2015.07.023
Mathematical Foundations of Computer Science 2014
Julien Cassaigne, Gabriele Fici, Marinella Sciortino and Luca Q. ZamboniLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2014 8634 159 (2014)
https://doi.org/10.1007/978-3-662-44522-8_14
BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS
VALÉRIE BERTHÉ, JULIEN CASSAIGNE and WOLFGANG STEINERInternational Journal of Algebra and Computation 23 (04) 689 (2013)
https://doi.org/10.1142/S0218196713400043
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
A. Blondin Massé, S. Brlek, A. Garon and S. LabbéTheoretical Computer Science 412 (36) 4778 (2011)
https://doi.org/10.1016/j.tcs.2010.12.034
On the superimposition of Christoffel words
Geneviève Paquin and Christophe ReutenauerTheoretical Computer Science 412 (4-5) 402 (2011)
https://doi.org/10.1016/j.tcs.2010.10.007
Hopcroft's algorithm and tree-like automata
G. Castiglione, A. Restivo and M. SciortinoRAIRO - Theoretical Informatics and Applications 45 (1) 59 (2011)
https://doi.org/10.1051/ita/2011011
BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS
ROBERTO MANTACI, SABRINA MANTACI and ANTONIO RESTIVOInternational Journal of Foundations of Computer Science 21 (04) 647 (2010)
https://doi.org/10.1142/S0129054110007477
On extremal cases of Hopcroft’s algorithm
G. Castiglione, A. Restivo and M. SciortinoTheoretical Computer Science 411 (38-39) 3414 (2010)
https://doi.org/10.1016/j.tcs.2010.05.025
Discrete Geometry for Computer Imagery
Alexandre Blondin-Massé, Srečko Brlek, Ariane Garon and Sébastien LabbéLecture Notes in Computer Science, Discrete Geometry for Computer Imagery 5810 67 (2009)
https://doi.org/10.1007/978-3-642-04397-0_7
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
Circular sturmian words and Hopcroft’s algorithm
G. Castiglione, A. Restivo and M. SciortinoTheoretical Computer Science 410 (43) 4372 (2009)
https://doi.org/10.1016/j.tcs.2009.07.018
Implementation and Application of Automata
Giusi Castiglione, Antonio Restivo and Marinella SciortinoLecture Notes in Computer Science, Implementation and Application of Automata 5642 14 (2009)
https://doi.org/10.1007/978-3-642-02979-0_5
Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm
Jean Berstel, Luc Boasson and Olivier CartonTheoretical Computer Science 410 (30-32) 2811 (2009)
https://doi.org/10.1016/j.tcs.2009.01.039
Developments in Language Theory
Roberto Mantaci, Sabrina Mantaci and Antonio RestivoLecture Notes in Computer Science, Developments in Language Theory 5257 504 (2008)
https://doi.org/10.1007/978-3-540-85780-8_40
Language and Automata Theory and Applications
Giusi Castiglione, Antonio Restivo and Marinella SciortinoLecture Notes in Computer Science, Language and Automata Theory and Applications 5196 172 (2008)
https://doi.org/10.1007/978-3-540-88282-4_17
On an involution of Christoffel words and Sturmian morphisms
Valérie Berthé, Aldo de Luca and Christophe ReutenauerEuropean Journal of Combinatorics 29 (2) 535 (2008)
https://doi.org/10.1016/j.ejc.2007.03.001