Results 171 to 180 of about 948,909 (194)
Some of the next articles are maybe not open access.
Structure of Polyzetas and Lyndon Words
Vietnam Journal of Mathematics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Two-Dimensional Lyndon Words
2013A Lyndon word is a primitive string which is lexicographically smallest among cyclic permutations of its characters. Lyndon words are used for constructing bases in free algebras, constructing de Bruijn sequences, finding the lexicographically smallest or largest substring in a string, and succinct suffix-prefix matching of highly periodic strings.
Shoshana Marcus, Dina Sokol
openaire +2 more sources
Lyndon factorization of infinite words
1996Infinite Lyndon words have been introduced in [1], where the authors proved a factorization theorem for infinite words: any infinite word can be written as a non increasing product of Lyndon words, finite and/or infinite. After giving a new characterization of infinite Lyndon words, we concentrate on three well known infinite words and give their ...
openaire +1 more source
Periodic musical sequences and Lyndon words
Soft Computing, 2004When one enumerates periodic musical structures, the computation is done up to a cyclic shift. This means that two solutions which are cyclic shifts of one another are considered the same. Lyndon words provide a powerful way to do so. We illustrate this by two examples taken from African traditional music.
openaire +4 more sources
2010
A sequence that is minimal among all its cyclic rotations is called a necklace (see section 3.5.2 on page 149 for the definition in terms of equivalence classes). Necklaces with k possible values for each element arecalled k-ary (or k-bead) necklaces. We restrict our attention to binary necklaces:only two values are allowed and we represent them by 0 ...
openaire +1 more source
A sequence that is minimal among all its cyclic rotations is called a necklace (see section 3.5.2 on page 149 for the definition in terms of equivalence classes). Necklaces with k possible values for each element arecalled k-ary (or k-bead) necklaces. We restrict our attention to binary necklaces:only two values are allowed and we represent them by 0 ...
openaire +1 more source
1990
A code has bounded synchronization delay if there exists an integer s such that at most s consecutive bits are required to establish word synchronization in any message. The set of Lyndon words of length n, Λ n , is the set obtained by choosing those strings which are lexicographically least in the primitive equivalence classes determined by cyclic ...
openaire +1 more source
A code has bounded synchronization delay if there exists an integer s such that at most s consecutive bits are required to establish word synchronization in any message. The set of Lyndon words of length n, Λ n , is the set obtained by choosing those strings which are lexicographically least in the primitive equivalence classes determined by cyclic ...
openaire +1 more source
The set of Lyndon words is not context-free
Bull. EATCS, 1997Summary: A word is primitive if it is not a proper power of a shorter word. A Lyndon word is a primitive word which is minimal under cyclic permutation. The status of the languages \(Q\) of primitive words and \(L\) of Lyndon words with respect to the Chomsky hierarchy appears still to be open. It has been shown by \textit{H. Petersen} [Theor.
Berstel, Jean, Boasson, Luc
openaire +3 more sources
Generalized Lyndon factorizations of infinite words
Theoretical Computer Science, 2020Amanda Burcroff
exaly