Return words in sturmian and episturmian words

Jacques Justin; Laurent Vuillon

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2000)

  • Volume: 34, Issue: 5, page 343-356
  • ISSN: 0988-3754

How to cite

top

Justin, Jacques, and Vuillon, Laurent. "Return words in sturmian and episturmian words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 34.5 (2000): 343-356. <http://eudml.org/doc/92639>.

@article{Justin2000,
author = {Justin, Jacques, Vuillon, Laurent},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {recurrent infinite word; episturmian words; recurrence function},
language = {eng},
number = {5},
pages = {343-356},
publisher = {EDP-Sciences},
title = {Return words in sturmian and episturmian words},
url = {http://eudml.org/doc/92639},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Justin, Jacques
AU - Vuillon, Laurent
TI - Return words in sturmian and episturmian words
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 5
SP - 343
EP - 356
LA - eng
KW - recurrent infinite word; episturmian words; recurrence function
UR - http://eudml.org/doc/92639
ER -

References

top
  1. [1] J.-P. Allouche, J.L. Davison, M. Queffélec and L.Q. Zamboni, Transcendence of Sturmian or morphic continued fractions. Preprint (1999). Zbl0998.11036MR1869317
  2. [2] P. Arnoux and G. Rauzy, Représentation géométrique de suites de complexité 2n + 1. Bull. Soc. Math. France 119 (1991) 199-215. Zbl0789.28011MR1116845
  3. [3] J. Berstel and P. Séébold, Sturmian words, edited by M. Lothaire, Algebraic combinatorics on Words (to appear). Zbl0883.68104MR1905123
  4. [4] J. Cassaigne, Ideas for a proof of Rauzy's conjecture on the recurrence functions of infinite words, talk in Rouen "words 1999". 
  5. [5] N. Chekhova, P. Hubert and A. Messaoudi, Propriétés combinatoires, ergodiques et arithmétiques de la substitution de Tribonacci. Prepublication 98-24 IML. 
  6. [6] A. de Luca, Sturmian words: Structure, Combinatorics and their Arithmetics. Theoret. Comput. Sci. 183 (1997) 45-82. Zbl0911.68098MR1468450
  7. [7] X. Droubay, J. Justin and G. Pirillo, Episturmian words and some constructions of Rauzy and de Luca. Theoret. Comput. Sci. (to appear). Zbl0981.68126MR1819089
  8. [8] F. Durand, A characterization of substitutive sequences using return words. Discrete Math. 179 (1998) 89-101. Zbl0895.68087MR1489074
  9. [9] F. Durand, Contributions à l'étude des suites et systèmes dynamiques substitutifs. Ph. D. Thesis, Université de la Méditerranée, Aix-Marseille II (1996). 
  10. [10] I. Fagnot and L. Vuillon, Generalized balances in Sturmian words. Prepublication LIAFA 2000/02. 
  11. [11] G. A. Hedlund and M. Morse, Symbolic dynamics II: Sturmian trajectories. Amer. J. Math. 62 (1940) 1-42. Zbl0022.34003MR745JFM66.0188.03
  12. [12] C. Holton and L. Q. Zamboni, Geometric realizations of substitutions. Bull. Soc. Math. France 126 (1998) 149-179. Zbl0931.11004MR1675970
  13. [13] J. Justin and G. Pirillo, Episturmian words and episturmian morphisms. Prepublication LIAFA 2000/23. Zbl1002.68116
  14. [14] L. Vuillon, A characterization of Sturmian words by return words. European J. Combin. 22 (2001) 263-275. Zbl0968.68124MR1808196

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.