Sciweavers

5 search results - page 1 / 1
» Infinite Smooth Lyndon Words
Sort
View
STRINGOLOGY
2008
13 years 5 months ago
Infinite Smooth Lyndon Words
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...
Geneviève Paquin
DMTCS
2010
123views Mathematics» more  DMTCS 2010»
13 years 1 months ago
A characterization of infinite smooth Lyndon words
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...
Geneviève Paquin
TCS
2008
13 years 4 months ago
Smooth words on 2-letter alphabets having same parity
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
Srecko Brlek, Damien Jamet, Geneviève Paqui...
TCS
2008
13 years 4 months ago
Quasiperiodic and Lyndon episturmian words
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...
Amy Glen, Florence Levé, Gwénaë...
CAGD
2008
104views more  CAGD 2008»
13 years 4 months ago
On the curvature of guided surfaces
Following [KP07], we analyze surfaces arising as an infinite sequence of guided C2 surface rings. However, here we focus on constructions of too low a degree to be curvature conti...
Kestutis Karciauskas, Jörg Peters