Results 11 to 20 of about 948,909 (194)
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
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
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
Properties of the extremal infinite smooth words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in nite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of
Srečko Brlek +2 more
doaj +3 more sources
ARTICLES, REPORTS AND SPEECHES, 1998-2008 - Lectures - Lyndon Lecture, 2005
, 2016 Lecture from Donlyn Lyndon in 2005 for the Wallenberg Lecture Series.http://deepblue.lib.umich.edu/bitstream/2027.42/118166/2/39015094711952.mp4http://deepblue.lib.umich.edu/bitstream/2027.42/118166/3/39015094711952 ...
University of Michigan. A. Alfred Taubman College of Architecture and Urban Planning
core +7 more sources
On generalized Lyndon words [PDF]
Theoretical Computer Science, 2019 A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as a nonincreasing factorization of generalized Lyndon words.
Francesco Dolce +2 more
openaire +2 more sources
On Lyndon-Word Representable Graphs [PDF]
, 2022 In this short note, we first associate a new simple undirected graph with a given word over an ordered alphabet of $n$-letters. We will call it the Lyndon graph of that word.
Faal, Hossein Teimoori
core +1 more source
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words [PDF]
, 2020 Lyndon words have been largely investigated and showned to be a useful tool to prove interesting combinatorial properties of words. In this paper we state new properties of both Lyndon and inverse Lyndon factorizations of a word $w$, with the aim of exploring their use in some classical queries on $w$.
Paola Bonizzoni +3 more
openaire +3 more sources
The height of the Lyndon tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We consider the set $\mathcal{L ...
Lucas Mercier, Philippe Chassaing
doaj +1 more source