Strong Repetitions in Sturmian Strings

2010 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    25
    References
    0
    Citations
    NaN
    KQI
    []