Recurrence in infinite words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 1-11

  Cassaigne, Julien ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INFINITE WORD;

ARTIFICIAL INTELLIGENCE;

EID: 23044525947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_1     Document Type: Conference Paper

References (18)

1. J.-P. Allouche and M. Bousquet-Mélou, On the conjectures of Rauzy and Shallit for infinite words, Comment. Math. Univ. Carolinae 36 (1995), 705-711.
2. J.-P. Allouche, J. L. Davison, M. Queffélec, and L. Q. Zamboni, Tran- scendence of Sturmian or morphic continued fractions. Preprint.
3. J. Cassaigne, Special factors of sequences with linear subword complexity, in Developments in Language Theory II, pp. 25-34, World Scientific, 1996.
4. J. Cassaigne, Facteurs spéciaux et complexité, Bull. Belg. Math. Soc. 4 (1997), 67-88.
5. J. Cassaigne, On a conjecture of J. Shallit, in ICALP'97, pp. 693-704, Lect. Notes Comput. Sci. 1256, Springer-Verlag, 1997.
6. J. Cassaigne, Sequences with grouped factors, in Developments in Language The- ory III, pp. 211-222, Aristotle University of Thessaloniki, 1998.
7. J. Cassaigne, Limit values of the recurrence quotient of Sturmian sequences, Theoret. Comput. Sci. 218 (1999), 3-12.
8. N. Chekhova, Fonctions de récurrence des suites d'Arnoux-Rauzy et réponse àune question de Morse et Hedlund. Preprint.
9. F. Durand, A characterization of substitutive sequences using return words, Dis- crete Math. 179 (1998), 89-101.
10. F. Durand, Linearly recurrent subshifts, Research report 98-02, Institut de Mathématiques de Luminy, Marseille, France, 1998.
11. F. Durand, B. Host, and C. Skau, Substitutions, Bratteli diagrams and dimension groups, Ergod. Th. Dyn. Sys. 19 (1999), 952-993.
12. M. Lothaire, Algebraic combinatorics on words. To appear. Available online at http://www-igm.univ-mlv.fr/~berstel/Lothaire/.
13. M. Morse and G. A. Hedlund, Symbolic dynamics, Amer. J. Math. 60 (1938), 815-866.
14. M. Morse and G. A. Hedlund, Symbolic dynamics II: Sturmian trajectories, Amer. J. Math. 61 (1940), 1-42.
15. C. Pomerance, J. M. Robson, and J. Shallit, Automaticity II: Descriptional complexity in the unary case, Theoret. Comput. Sci. 180 (1997), 181-201.
16. G. Rauzy, Suites à termes dans un alphabet fini, Sém. Théor. Nombres Bordeaux, 1982-1983, 25.01-25.16.
17. G. Rote, Sequences with subword complexity 2n, J. Number Theory 46 (1994), 196-213.
18. Z.-X. Wen and Z.-Y. Wen, Some properties of the singular words of the Fibonacci word, European J. Combin 15 (1994), 587-598.