Results 41 to 50 of about 1,338,709 (133)
Some variations on Lyndon words
CoRR, 2019 arXiv admin note: text overlap with arXiv:1812 ...
Francesco Dolce +2 more
openaire +2 more sources
Circle formation of weak robots and Lyndon words [PDF]
Information Processing Letters, 2007 A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the distributed control of a set of n weak mobile robots. By weak, we mean that the robots are anonymous, memoryless, without any common sense of direction, and ...
Yoann Dieudonné, Franck Petit
openaire +5 more sources
Episturmian words: a survey [PDF]
, 2007 In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters.
Justin, J. +5 more
core +1 more source
Monomial algebras defined by Lyndon words
Journal of Algebra, 2014 Assume that $X= {x_1,...,x_g}$ is a finite alphabet and $K$ is a field. We study monomial algebras $A= K /(W)$, where $W$ is an antichain of Lyndon words in $X$ of arbitrary cardinality. We find a Poincaré-Birkhoff-Witt type basis of $A$ in terms of its \emph{Lyndon atoms} $N$, but, in general, $N$ may be infinite.
Gateva-Ivanova, T., Fløystad, G.
openaire +4 more sources
Lyndon words with a fixed standard right factor [PDF]
, 2004 International audienceGiven a totally ordered alphabet A = {a1 < a2 < < aq}, a Lyndon word is a word that is strictly smaller, for the lexicographical order, than any of its conjugates (i.e., all words obtained by a circular permutation on the letters ...
Clément, Julien +2 more
core +3 more sources
V-Words, Lyndon Words and Galois Words
We say that a family $\mathcal{W}$ of strings over $Σ^+$ forms a Unique Maximal Factorization Family (UMFF) if and only if every $w \in \mathcal{W}$ has a unique maximal factorization. Further, an UMFF $\mathcal{W}$ is called a circ-UMFF whenever it contains exactly one rotation of every primitive string $x \in Σ^+$.
Jacqueline W. Daykin +2 more
openaire +3 more sources
Lyndon Words Accelerate Suffix Sorting.
, 2021 Suffix sorting is arguably the most fundamental building block in string algorithmics, like regular sorting in the broader field of algorithms. It is thus not surprising that the literature is full of algorithms for suffix sorting, in particular focusing on their practicality. However, the advances on practical suffix sorting stalled with the emergence
Bertram, Nico +2 more
openaire +3 more sources
Lyndon words and singular factors of Sturmian words
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
An extension of the Lyndon–Schützenberger result to pseudoperiodic words
Information and Computation, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elena Czeizler +3 more
openaire +3 more sources
A Characterization of Binary Morphisms Generating Lyndon Infinite Words
, 2021 International audienceAn infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes.
Richomme, Gwenaël +3 more
core +1 more source