Average cost of Duval's algorithm for generating Lyndon words
From MaRDI portal
Cites work
- Amortized Computational Complexity
- Constant Time Generation of Free Trees
- Factorizing words over an ordered alphabet
- Generating Binary Trees Lexicographically
- Generating necklaces
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- scientific article; zbMATH DE number 417855 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3957110 (Why is no real title available?)
- scientific article; zbMATH DE number 3351382 (Why is no real title available?)
- Lexicographically least circular substrings
- On Burnside's Problem
- Singularity Analysis of Generating Functions
Cited in
(6)- The standard factorization of Lyndon words: an average point of view
- Efficient indexing of necklaces and irreducible polynomials over finite fields
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- Computation of maximal determinants of binary circulant matrices
- On the construction of invertible vector Boolean functions
- Necklaces and Lyndon words in colexicographic order
This page was built for publication: Average cost of Duval's algorithm for generating Lyndon words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334678)
