Lyndon words and density of runs
From International Center for Computational Logic
Lyndon words and density of runs
Talk by Štěpán Holub
- Location: APB 3027
- Start: 15. December 2016 at 11:00 am
- End: 15. December 2016 at 12:00 pm
- Research group: Knowledge-Based Systems
- 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.
