Results 1 to 10 of about 1,338,709 (133)
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words [PDF]
Lecture Notes in Computer Science, 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 +2 more
exaly +6 more sources
On morphisms preserving infinite Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words.
Gwénaël Richomme
doaj +8 more sources
Gray Code Order for Lyndon Words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 At the 4 th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whether the dual reflected order yields a Gray code on the Lyndon family. In this paper we give a positive answer.
Vincent Vajnovszki
doaj +7 more sources
A characterization of infinite smooth Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Combinatorics
Geneviève Paquin
doaj +7 more sources
Theoretical Computer Science, 2020 Let $\A$ be a finite non-empty set and $\preceq $ a total order on $\A^\nats$ verifying the following lexicographic like condition: For each $n\in \nats$ and $u, v\in \A^n,$ if $u^ω\prec v^ω$ then $ux\prec vy$ for all $x, y \in \A^\nats.$ A word $x\in \A^\nats$ is called $ω$-Lyndon if $x\prec y$ for each proper suffix $y$ of $x.$ A finite word $w\in \A^
Luca Q Zamboni
exaly +6 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
exaly +3 more sources
Lyndon factorization of generalized words of Thue [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 The i-th symbol of the well-known infinite word of Thue on the alphabet { 0,1} can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i.
Anton Černý
doaj +5 more sources
Theoretical Computer Science, 2020 Abstract Let A be a finite non-empty set and ⪯ a total order on A N verifying the following lexicographic like condition: For each n ∈ N and u , v ∈ A n , if u ω ≺ v ω then u x ≺ v y for all x , y ∈ A N . A word x ∈ A N is called ω-Lyndon if x
Luca Q Zamboni
exaly +5 more sources
Lyndon words and Fibonacci numbers
Journal of Combinatorial Theory - Series A, 2014 It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon word of length n must have, but this bound is not optimal.
Kalle Saari
exaly +4 more sources
Unbordered factors and Lyndon words
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tero Harju
exaly +4 more sources