Border correlation of binary words

The border correlation function β: A* → A*, for A = {a, b}, specifies which conjugates (cyclic shifts) of a given word w of length n are bordered, in other words, β(w) = c0c1...cn-1 where ci=a or b according to whether the ith cyclic shift σi (ω) of w is unbordered or bordered. Except for some special cases, no binary word w has two consecutive unbordered conjugates (σi (w) and σi+1 (w)). We show that this is optimal: in every cyclically overlap-free word every other conjugate is unbordered. We also study the relationship between unbordered conjugates and critical points, as well as, the dynamic system given by iterating the function β. We prove that, for each word w of length n, the sequence w,β(w),β2(w),... terminates either in bn or in the cycle of conjugates of the word abkabk+1 for n = 2k + 3.

[1]  Adriaan J. de Lind van Wijngaarden,et al.  On the construction of maximal prefix-synchronized codes , 1996, IEEE Trans. Inf. Theory.

[2]  M. Lothaire Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .

[3]  Andrzej Ehrenfeucht,et al.  Periodicity and unbordered segments of words , 1979, Discret. Math..

[4]  Tao Jiang,et al.  Rotations of Periodic Strings and Short Superstrings , 1996, J. Algorithms.

[5]  Harold Marston Morse Recurrent geodesics on a surface of negative curvature , 1921 .

[6]  Leonidas J. Guibas,et al.  String Overlaps, Pattern Matching, and Nontransitive Games , 1981, J. Comb. Theory A.

[7]  Tero Harju,et al.  Density of Critical Factorizations , 2002, RAIRO Theor. Informatics Appl..

[8]  Grzegorz Rozenberg,et al.  The Book of L , 1986, Springer Berlin Heidelberg.

[9]  J. Berstel,et al.  Theory of codes , 1985 .

[10]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[11]  José Carlos Costa Biinfinite words with maximal recurrent unbordered factors , 2003, Theor. Comput. Sci..

[12]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[13]  M. Lothaire Algebraic Combinatorics on Words , 2002 .

[14]  Wai-Fong Chuan,et al.  Unbordered Factors of Characteristic Sequences of Irrational Numbers , 1998, Theor. Comput. Sci..

[15]  Christian Choffrut,et al.  Combinatorics of Words , 1997, Handbook of Formal Languages.

[16]  Tero Harju,et al.  ON CYCLICALLY OVERLAP-FREE WORDS IN BINARY ALPHABETS , 1986 .

[17]  Jean-Pierre Duval,et al.  Relationship between the period of a finite word and the length of its unbordered segments , 1982, Discret. Math..

[18]  William F. Smyth,et al.  Counting Distinct Strings , 1999, Algorithmica.