Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Mantaci, Roberto
Mantaci, Sabrina
and
Restivo, Antonio
2008.
Developments in Language Theory.
Vol. 5257,
Issue. ,
p.
504.
Castiglione, Giusi
Restivo, Antonio
and
Sciortino, Marinella
2008.
Language and Automata Theory and Applications.
Vol. 5196,
Issue. ,
p.
172.
Berthé, Valérie
de Luca, Aldo
and
Reutenauer, Christophe
2008.
On an involution of Christoffel words and Sturmian morphisms.
European Journal of Combinatorics,
Vol. 29,
Issue. 2,
p.
535.
Castiglione, G.
Restivo, A.
and
Sciortino, M.
2009.
Circular sturmian words and Hopcroft’s algorithm.
Theoretical Computer Science,
Vol. 410,
Issue. 43,
p.
4372.
Berstel, Jean
Boasson, Luc
and
Carton, Olivier
2009.
Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm.
Theoretical Computer Science,
Vol. 410,
Issue. 30-32,
p.
2811.
Paquin, Geneviève
2009.
On a generalization of Christoffel words: epichristoffel words.
Theoretical Computer Science,
Vol. 410,
Issue. 38-40,
p.
3782.
Castiglione, Giusi
Restivo, Antonio
and
Sciortino, Marinella
2009.
Implementation and Application of Automata.
Vol. 5642,
Issue. ,
p.
14.
Blondin-Massé, Alexandre
Brlek, Srečko
Garon, Ariane
and
Labbé, Sébastien
2009.
Discrete Geometry for Computer Imagery.
Vol. 5810,
Issue. ,
p.
67.
MANTACI, ROBERTO
MANTACI, SABRINA
and
RESTIVO, ANTONIO
2010.
BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS.
International Journal of Foundations of Computer Science,
Vol. 21,
Issue. 04,
p.
647.
Castiglione, G.
Restivo, A.
and
Sciortino, M.
2010.
On extremal cases of Hopcroft’s algorithm.
Theoretical Computer Science,
Vol. 411,
Issue. 38-39,
p.
3414.
Castiglione, G.
Restivo, A.
and
Sciortino, M.
2011.
Hopcroft's algorithm and tree-like automata.
RAIRO - Theoretical Informatics and Applications,
Vol. 45,
Issue. 1,
p.
59.
Paquin, Geneviève
and
Reutenauer, Christophe
2011.
On the superimposition of Christoffel words.
Theoretical Computer Science,
Vol. 412,
Issue. 4-5,
p.
402.
Blondin Massé, A.
Brlek, S.
Garon, A.
and
Labbé, S.
2011.
Two infinite families of polyominoes that tile the plane by translation in two distinct ways.
Theoretical Computer Science,
Vol. 412,
Issue. 36,
p.
4778.
BERTHÉ, VALÉRIE
CASSAIGNE, JULIEN
and
STEINER, WOLFGANG
2013.
BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS.
International Journal of Algebra and Computation,
Vol. 23,
Issue. 04,
p.
689.
Cassaigne, Julien
Fici, Gabriele
Sciortino, Marinella
and
Zamboni, Luca Q.
2014.
Mathematical Foundations of Computer Science 2014.
Vol. 8634,
Issue. ,
p.
159.
Labbé, Sébastien
and
Reutenauer, Christophe
2015.
A $$d$$ d -dimensional Extension of Christoffel Words.
Discrete & Computational Geometry,
Vol. 54,
Issue. 1,
p.
152.
Reutenauer, Christophe
2015.
Studies on finite Sturmian words.
Theoretical Computer Science,
Vol. 591,
Issue. ,
p.
106.
Castiglione, G.
and
Sciortino, M.
2015.
Standard Sturmian words and automata minimization algorithms.
Theoretical Computer Science,
Vol. 601,
Issue. ,
p.
58.
Cassaigne, Julien
Fici, Gabriele
Sciortino, Marinella
and
Zamboni, Luca Q.
2017.
Cyclic complexity of words.
Journal of Combinatorial Theory, Series A,
Vol. 145,
Issue. ,
p.
36.
Charlier, Émilie
Puzynina, Svetlana
and
Zamboni, Luca
2017.
On a group theoretic generalization of the Morse-Hedlund theorem.
Proceedings of the American Mathematical Society,
Vol. 145,
Issue. 8,
p.
3381.