Strong Repetitions in Sturmian Strings
Combinatorics
2011-03-08 v2
Abstract
In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.
Cite
@article{arxiv.1002.4598,
title = {Strong Repetitions in Sturmian Strings},
author = {Ayse Karaman},
journal= {arXiv preprint arXiv:1002.4598},
year = {2011}
}
Comments
16 pages, 1 table