Timeline for Maximal words (reloaded)
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2010 at 11:13 | comment | added | Moshe Schwartz | Another paper which might be of interest to you is "On the Generation of Aperiodic and Periodic Necklaces via T-augmentation" by Gulliver, Makwakwa, and Speidel. | |
| Sep 27, 2010 at 10:38 | comment | added | Sam Nead | You perhaps will be interested in Duval's CAT algorithm for producing all Lyndon words with length $n$ or less. See the paper "Average cost of Duval's algorithm for generating Lyndon words" by Berstel and Pocchiola. | |
| Sep 27, 2010 at 10:25 | comment | added | ccarminat | Your are right on both issues. I was wandering if one can modify the algorithm to generate all possible primitive maximal words: probably one should consider concatenation between an item of the list and any 'smaller' item (where 'smaller' is referred to the order we get considering these finite words as periods of infinite words which are ordered with the usual lexicographic ordering). | |
| Sep 27, 2010 at 10:15 | vote | accept | ccarminat | ||
| Sep 27, 2010 at 10:09 | history | answered | Moshe Schwartz | CC BY-SA 2.5 |