Download

Full Text

• Allouche Jean-Paul, Shallit Jeffrey Automatic Sequences. Theory, Applications, Generalizations 2003, Cambridge University Press, Cambridge.
• Arnoux Pierre, Rauzy Gérard Représentation géométrique de suites de complexité 2n+1. Bull. Soc. Math. Fr. 1991, 119(2):199-215.
• Berstel Jean, De Felice Clelia, Perrin Dominique, Reutenauer Christophe, Rindone Giuseppina Bifix codes and Sturmian words. J. Algebra 2012, 369:146-202.
• Berstel Jean, Perrin Dominique, Reutenauer Christophe Codes and Automata 2009, Cambridge University Press.
• Berthé Valérie, De Felice Clelia, Dolce Francesco, Leroy Julien, Perrin Dominique, Reutenauer Christophe, Rindone Giuseppina Acyclic, connected and tree sets (to appear in Monatsh. Math.). http://arxiv.org/abs/1308.4260.
• Berthé Valérie, De Felice Clelia, Dolce Francesco, Leroy Julien, Perrin Dominique, Reutenauer Christophe, Rindone Giuseppina Maximal bifix decoding (to appear in Discrete Math.). http://arxiv.org/abs/1308.5396.
• Berthé Valérie, De Felice Clelia, Dolce Francesco, Leroy Julien, Perrin Dominique, Reutenauer Christophe, Rindone Giuseppina Bifix codes and interval exchanges. J. Pure Appl. Algebra 2015, 219(7):2781-2798. in this issue. 10.1016/j.jpaa.2014.09.028.
• Combinatorics, Automata and Number Theory. Encycl. Math. Appl. 2010, vol. 135. Cambridge University Press, Cambridge. V. Berthé, M. Rigo (Eds.).
• Cassaigne Julien Complexité et facteurs spéciaux. Bull. Belg. Math. Soc. Simon Stevin 1997, 4(1):67-88.
• Julien Cassaigne, 2013, personal communication.
• Pytheas Fogg N. Substitutions in dynamics arithmetics and combinatorics. Lect. Notes Math. 2002, vol. 1794. Springer-Verlag, Berlin.
• Glen Amy, Justin Jacques Episturmian words: a survey. Theor. Inform. Appl. 2009, 43:403-442.
• Justin Jacques, Vuillon Laurent Return words in Sturmian and episturmian words. Theor. Inform. Appl. 2000, 34(5):343-356.
• Lothaire M. Algebraic Combinatorics on Words 2002, Cambridge University Press.