A1 Refereed original research article in a scientific journal
Bordered Conjugates of Words over Large Alphabets
Authors: Harju T, Nowotka D
Publisher: ELECTRONIC JOURNAL OF COMBINATORICS
Publication year: 2008
Journal:: The Electronic Journal of Combinatorics
Journal name in source: ELECTRONIC JOURNAL OF COMBINATORICS
Journal acronym: ELECTRON J COMB
Article number: ARTN N41
Volume: 15
Issue: 1
Number of pages: 7
ISSN: 1077-8926
Abstract
The border correlation function attaches to every word w a binary word beta(w) of the same length where ith letter tells whether the ith conjugate w ' = vu of w = uv is bordered or not. Let [u] denote the set of conjugates of word w. We show that for a 3-letter alphabet A, the set of beta-images equals beta(A(n)) B*/([ab(n-1)] UD) where D = {a(n)} if n epsilon {5, 7, 9, 10, 14, 17}, and otherwise D = phi. Hence the number of beta-images is B(3)(n) = 2(n) - n - m, where m = 1 if n epsilon {5, 7, 9, 10, 14, 17} and m = 0 otherwise.
The border correlation function attaches to every word w a binary word beta(w) of the same length where ith letter tells whether the ith conjugate w ' = vu of w = uv is bordered or not. Let [u] denote the set of conjugates of word w. We show that for a 3-letter alphabet A, the set of beta-images equals beta(A(n)) B*/([ab(n-1)] UD) where D = {a(n)} if n epsilon {5, 7, 9, 10, 14, 17}, and otherwise D = phi. Hence the number of beta-images is B(3)(n) = 2(n) - n - m, where m = 1 if n epsilon {5, 7, 9, 10, 14, 17} and m = 0 otherwise.
UTU Research Portal