Results 11 to 20 of about 83,383 (194)
The standard factorization of Lyndon words: an average point of view [PDF]
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frédérique Bassino, Julien Clement
exaly +7 more sources
On a factorization of graded Hopf algebras using Lyndon words [PDF]
Journal of Algebra, 2007 We find a generalization of the restricted PBW basis for pointed Hopf algebras over abelian groups constructed by Kharchenko. We obtain a factorization of the Hilbert series for a wide class of graded Hopf algebras. These factors are parametrized by Lyndon words, and they are the Hilbert series of certain graded Hopf algebras.
István Heckenberger
exaly +8 more sources
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
From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
CoRRarXiv admin note: substantial text overlap with arXiv:1911 ...
Paola Bonizzoni +3 more
core +5 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 +3 more sources
Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property [PDF]
CoRR11 pages, version submitted to MFCS2024.
Paola Bonizzoni +4 more
openaire +8 more sources
Lyndon-like and V-order factorizations of strings
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacqueline W Daykin
exaly +2 more sources
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text
Lecture Notes in Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuto Nakashima +2 more
exaly +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
Some Properties of the Quasi-Tribonacci Sequence
Mathematics, 2023 The quasi-Tribonacci sequence T, which is a transformation of the Tribonacci sequence, is the fixed point of morphism ϕ:0→01, 1→12, 2→0. In this paper, we study the properties of the factors in the quasi-Tribonacci sequence and give the singular ...
Jiemeng Zhang, Zhixiong Wen
doaj +1 more source