Results 111 to 120 of about 1,338,709 (133)
Some of the next articles are maybe not open access.
Reprint of: Generalized Lyndon factorizations of infinite words
Theoretical Computer Science, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amanda Burcroff
exaly +4 more sources
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.
exaly +5 more sources
Lyndon Partial Words and Arrays with Applications
Lecture Notes in Computer Science, 2023Meenakshi Paramasivan, Krishna Kumari
exaly +2 more sources
Partially commutative Lyndon words
, 1993 this paper takes also place in the same movement. In particular, a natural question was to see if one can propose a good notion of partially commutative Lyndon word that generalizes the usual definition.
Daniel Krob, Pierre Lalonde
openaire +2 more sources
Lyndon Words Formalized in Isabelle/HOL
2021We present a formalization of Lyndon words and basic relevant results in Isabelle/HOL. We give a short review of Isabelle/HOL and focus on challenges that arise in this formalization. The presented formalization is based on an ongoing larger project of formalization of combinatorics on words.
Štěpán Holub, Štěpán Starosta
openaire +1 more source
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words [PDF]
Theoretical Computer Science, 2007 Using the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we answer a question of G. Melançon. We characterize cases where the sequence of Lyndon words in the Lyndon factorization of a standard Sturmian word is morphic.
G. Richomme +2 more
exaly +2 more sources
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
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