Lyndon words and density of runs: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
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…“) |
Irina Dragoste (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
{{Veranstaltung | {{Veranstaltung | ||
|Titel EN=Lyndon words and density of runs | |Titel EN=Lyndon words and density of runs | ||
|Beschreibung EN=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. | |Beschreibung EN=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. | ||
|Veranstaltungsart=Vortrag | |Veranstaltungsart=Vortrag | ||
|Start=2016/12/15 11:00:00 | |Start=2016/12/15 11:00:00 | ||
| Zeile 8: | Zeile 8: | ||
|Vortragender=Štěpán Holub | |Vortragender=Štěpán Holub | ||
|Forschungsgruppe=Wissensbasierte Systeme | |Forschungsgruppe=Wissensbasierte Systeme | ||
|Event series=KBS Seminar | |||
|In News anzeigen=1 | |In News anzeigen=1 | ||
}} | }} | ||
Aktuelle Version vom 18. Oktober 2018, 04:17 Uhr
Lyndon words and density of runs
Vortrag von Štěpán Holub
- Veranstaltungsort: APB 3027
- Beginn: 15. Dezember 2016 um 11:00
- Ende: 15. Dezember 2016 um 12:00
- Forschungsgruppe: Wissensbasierte Systeme
- Event series: KBS Seminar
- iCal
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.
