The “runs” theorem
We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon
words. The characterization leads to a proof of what was known as the “runs” conjecture RM …
words. The characterization leads to a proof of what was known as the “runs” conjecture RM …
Optimal square detection over general alphabets
Squares (fragments of the form xx, for some string x) are arguably the most natural type of
repetition in strings. The basic algorithmic question concerning squares is to check if a given …
repetition in strings. The basic algorithmic question concerning squares is to check if a given …
A new characterization of maximal repetitions by Lyndon trees
We give a new characterization of maximal repetitions (or runs) in strings, using a tree
defined on recursive standard factorizations of Lyndon words, called the Lyndon tree. The …
defined on recursive standard factorizations of Lyndon words, called the Lyndon tree. The …
[書籍][B] Combinatorics, words and symbolic dynamics
Internationally recognised researchers look at develo** trends in combinatorics with
applications in the study of words and in symbolic dynamics. They explain the important …
applications in the study of words and in symbolic dynamics. They explain the important …
Beyond the runs theorem
Beyond the Runs Theorem Page 1 Beyond the Runs Theorem Johannes Fischer1, Štepán
Holub2, Tomohiro I1(B), and Moshe Lewenstein3 1 Department of Computer Science, TU …
Holub2, Tomohiro I1(B), and Moshe Lewenstein3 1 Department of Computer Science, TU …
[HTML][HTML] Prefix frequency of lost positions
Š Holub - Theoretical Computer Science, 2017 - Elsevier
The concept of “lost positions” is a recently introduced tool for counting the number of runs in
words. We investigate the frequency of lost positions in prefixes of words. This leads to an …
words. We investigate the frequency of lost positions in prefixes of words. This leads to an …
Optimal Bounds for Distinct Quartics
P Charalampopoulos, P Gawrychowski… - ar** squares: The general case characterized & applications
W Bland, WF Smyth - Theoretical Computer Science, 2015 - Elsevier
Abstract The “Three Squares Lemma”[9] famously explored the consequences of supposing
that three squares occur at the same position in a string; essentially it showed that this …
that three squares occur at the same position in a string; essentially it showed that this …