Lyndon words and density of runs

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Lyndon words and density of runs

Vortrag von Štěpán Holub
The concept of Lyndon words is very useful in combinatorics on words. We shall illustrate that namely on the question asking how many maximal repetitions (called also "runs") a (binary) word can contain.