Lyndon word
Top View
- Computing K-Th Lyndon Word and Decoding Lexicographically Minimal De Bruijn Sequence
- Lyndon Words, Permutations and Trees
- On Generalized Lyndon Words
- Combinatorics on Words: an Introduction
- Computing K-Th Lyndon Word and Decoding Lexicographically Minimal De Bruijn Sequence
- Generalized Lyndon Factorizations of Infinite Words
- Evolutionary Search Techniques for the Lyndon Factorization of Biosequences Clare, Amanda; Daykin, Jacqueline; Mills, Thomas; Zarges, Christine
- Arxiv:1911.01851V1 [Cs.FL] 2 Nov 2019
- Hall Basis of Twisted Lie Algebras Marc Aubry
- Finely Homogeneous Computations in Free Lie Algebras Philippe Andary
- An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence
- Enumerative Combinatorics on Words 5 Dominique Perrin and Antonio Restivo 1.1 Introduction
- Arxiv:2103.12332V1 [Math.CO] 23 Mar 2021 H Soitdro Pcsfe Otsae of Spaces Root Free Spaces Root Associated the Hoai Polynomials
- Efficient Ranking of Lyndon Words and Decoding Lexicographically
- Combinatorics of Lyndon Words
- Enumerating All the Irreducible Polynomials Over Finite Field
- In-Place Bijective Burrows-Wheeler Transforms
- Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings †