DMTCS
2010
13 years 9 months ago
2010
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only...
TCS
2008
14 years 10 days ago
2008
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...
CORR
2007
Springer
14 years 13 days ago
2007
Springer
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
STRINGOLOGY
2008
14 years 1 months ago
2008
In a recent paper, Brlek et al showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: what are the infinite smooth w...
114
click to vote
Book
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...