Recurrence in infinite partial words

  • Authors:

  • F. Blanchet-Sadri;Bob Chen;Sinziana Munteanu

  • Affiliations:

  • Department of Computer Science, University of North Carolina, PO Box 26170, Greensboro, NC 27402-6170, USA;Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, Dept 0112, LaJolla, CA 92093-0112, USA;School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213-3891, USA

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2014

Quantified Score

Hi-index 5.23

Visualization

Abstract

The recurrence functionR"w(n) of an infinite word w was introduced by Morse and Hedlund in relation to symbolic dynamics. It is the size of the smallest window such that, wherever its position on w, all length n subwords of w will appear at least once inside that window. The recurrence quotient@r(w) of w, defined as limsupR"w(n)n, is useful for studying the growth rate of R"w(n). It is known that if w is periodic, then @r(w)=1, while if w is not, then @r(w)=3. A long standing conjecture from Rauzy states that the latter can be improved to @r(w)=5+52~3.618, this bound being true for each Sturmian word and being reached by the Fibonacci word. In this paper, we study in particular the spectrum of values taken by the recurrence quotients of infinite partial words, which are sequences that may have some undefined positions. In this case, we determine exactly the spectrum of values, which turns out to be 1, every real number greater than or equal to 2, and ~. More precisely, if an infinite partial word w is ''ultimately factor periodic'', then @r(w)=1, while if w is not, then @r(w)=2, and we give constructions of infinite partial words achieving each value.