Abstract
We survey some results and problems related to the notion of recurrence for infinite words.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
J.-P. Allouche, J.L. Davison, M. Queffélec, and L. Q. Zamboni, Transcendence of Sturmian or morphic continued fractions. Preprint.
J. Cassaigne, Special factors of sequences with linear subword complexity, in Developments in Language Theory II, pp. 25–34, World Scientific, 1996.
J. Cassaigne, Facteurs spéciaux et complexité, Bull. Belg. Math. Soc. 4 (1997), 67–88.
J. Cassaigne, On a conjecture of J. Shallit, in ICALP’97, pp. 693–704, Lect. Notes Comput. Sci. 1256, Springer-Verlag, 1997.
J. Cassaigne, Sequences with grouped factors, in Developments in Language Theory III, pp. 211–222, Aristotle University of Thessaloniki, 1998.
J. Cassaigne, Limit values of the recurrence quotient of Sturmian sequences, Theoret. Comput. Sci. 218 (1999), 3–12.
N. Chekhova, Fonctions de récurrence des suites d’Arnoux-Rauzy et réponse á une question de Morse et Hedlund. Preprint.
F. Durand, A characterization of substitutive sequences using return words, Discrete Math. 179 (1998), 89–101.
F. Durand, Linearly recurrent subshifts, Research report 98-02, Institut de Mathématiques de Luminy, Marseille, France, 1998.
F. Durand, B. Host, and C. Skau, Substitutions, Bratteli diagrams and dimension groups, Ergod. Th. Dyn. Sys. 19 (1999), 952–993.
M. Lothaire, Algebraic combinatorics on words. To appear. Available online at http://www-igm.univ-mlv.fr/~berstel/Lothaire/.
M. Morse and G. A. Hedlund, Symbolic dynamics, Amer. J. Math. 60 (1938), 815–866.
M. Morse and G. A. Hedlund, Symbolic dynamics II: Sturmian trajectories, Amer. J. Math. 61 (1940), 1–42.
C. Pomerance, J. M. Robson, and J. Shallit, Automaticity II: Descriptional complexity in the unary case, Theoret. Comput. Sci. 180 (1997), 181–201.
G. Rauzy, Suites á termes dans un alphabet fini, Sém. Théor. Nombres Bordeaux, 1982-1983, 25.01–25. 16.
G. Rote, Sequences with subword complexity 2n, J. Number Theory 46 (1994), 196–213.
Z.-X. Wen and Z.-Y. Wen, Some properties of the singular words of the Fibonacci word, European J. Combin 15 (1994), 587–598.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cassaigne, J. (2001). Recurrence in Infinite Words. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-44693-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41695-1
Online ISBN: 978-3-540-44693-4
eBook Packages: Springer Book Archive