Work

Strong Repetitions in Sturmian Strings

Year: 2010
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W1616107640
Cites: 21
Cited by:
Related to: 10