Lyndon words and density of runs

Aus International Center for Computational Logic
Version vom 6. Dezember 2016, 22:59 Uhr von Tomas Masopust (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Lyndon words and density of runs |Beschreibung EN=The concept of Lyndon words is very useful in combinatorics on words. We shall illu…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
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.