Results 11 to 20 of about 1,338,709 (133)
Inverse Lyndon words and inverse Lyndon factorizations of words [PDF]
Advances in Applied Mathematics, 2018 Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that is Lyndon words with respect to the inverse lexicographic order. The Lyndon factorization of a nonempty word w is
BONIZZONI, PAOLA +3 more
openaire +6 more sources
Transfinite Lyndon Words [PDF]
Logical Methods in Computer Science, 2015 In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a relaxation of the condition used in the case of finite words.
Luc Boasson, Olivier Carton
openaire +8 more sources
Quasiperiodic and Lyndon episturmian words [PDF]
Theoretical Computer Science, 2008 33 pages; minor ...
Glen, A., Levé, F., Richomme, G.
core +6 more sources
Lyndon factorization of sturmian words [PDF]
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Melançon, Guy, Guy Melançon
openaire +4 more sources
Lyndon factorization of the Prouhet words
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrice Seebold
exaly +3 more sources
Transfinite Lyndon words [PDF]
Logical Methods in Computer Science, 2020 In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a relaxation of the ...
Olivier Carton, Luc Boasson
doaj +1 more source
, 2018 The first print magazine from 1000 Words. 2018 marks the 10th anniversary of 1000 Words, and what better way to celebrate than to publish a special print annual?
Clark, Tim, 1000 Words
core +6 more sources
Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids [PDF]
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lalonde, Pierre
openaire +2 more sources
Finely homogeneous computations in free Lie algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 We first give a fast algorithm to compute the maximal Lyndon word (with respect to lexicographic order) of Ly α (A) for every given multidegree alpha in N k. We then give an algorithm to compute all the words living in Ly α (A) for any given α
Philippe Andary
doaj +2 more sources