References

1. Fabien Durand (1998): A characterization of substitutive sequences using return words. Discrete Math. 179(1-3), pp. 89–101, doi:10.1016/S0012-365X(97)00029-0.
2. Oliver Jenkinson & Luca Q. Zamboni (2004): Characterisations of balanced words via orderings. Theoret. Comput. Sci. 310(1-3), pp. 247–271, doi:10.1016/S0304-3975(03)00397-9.
3. Jacques Justin & Laurent Vuillon (2000): Return words in Sturmian and episturmian words. Theor. Inform. Appl. 34(5), pp. 343–356, doi:10.1051/ita:2000121.
4. M. Lothaire (2002): Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications 90. Cambridge University Press, Cambridge.
5. S. Mantaci, A. Restivo & M. Sciortino (2003): Burrows-Wheeler transform and Sturmian words. Inform. Process. Lett. 86(5), pp. 241–246, doi:10.1016/S0020-0190(02)00512-4.
6. Laurent Vuillon (2001): A characterization of Sturmian words by return words. European J. Combin. 22(2), pp. 263–275, doi:10.1006/eujc.2000.0444.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org