Jump to content

Recurrent word

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Deltahedron (talk | contribs) at 22:28, 15 December 2012 (expand, from Sesquipower and Thue–Morse sequence). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, a recurrent word or sequence is an infinite sequence over a finite alphabet in which every factor occurs infinitely often.[1] An infinite word is recurrent if and only if it is a sesquipower.[2][3]

A uniformly recurrent word is a recurrent word in which for any given factor X in the sequence, there is some length nX (often much longer than the length of X) such that X appears in every block of length n.[1][4]

Examples

  • The easiest way to make a recurrent sequence is to form a periodic sequence, one where the sequence repeats entirely after a given number m of steps. Then nX can be set to any multiple of m that is larger than twice the length of X.
  • The Thue–Morse sequence is uniformly recurrent without being periodic, nor even eventually periodic (meaning periodic after some nonperiodic initial segment).[5]

References

  1. ^ a b Lothaire (2011) p. 30
  2. ^ Lothaire (2011) p. 141
  3. ^ Berstel et al (2009) p.133
  4. ^ Berthé, Valérie; Rigo, Michel, eds. (2010). Combinatorics, automata, and number theory. Encyclopedia of Mathematics and its Applications. Vol. 135. Cambridge: Cambridge University Press. p. 7. ISBN 978-0-521-51597-9. Zbl 1197.68006.
  5. ^ Lothaire (2011) p.31