Strong Repetitions in Sturmian Strings
Ayse Karaman
TL;DR
This paper investigates the structure of Sturmian words, focusing on their repetitive patterns, and introduces a linear-time algorithm for computing runs, addressing an open problem in the field.
Contribution
It presents the first linear-time algorithm for finding runs in Sturmian words, based on analyzing their periodic factors.
Findings
Linear-time algorithm for runs in Sturmian words
Analysis of periodic factors in Sturmian words
Addresses an open problem in string algorithms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Algorithms and Data Compression