Strong Repetitions in Sturmian Strings

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 1 table

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Strong Repetitions in Sturmian Strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strong Repetitions in Sturmian Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strong Repetitions in Sturmian Strings will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-261045

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.