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)
DOI10.1016/0304-3975(88)90113-2zbMATH Open0673.68042OpenAlexW2014439890WikidataQ29393546 ScholiaQ29393546MaRDI QIDQ1121024FDOQ1121024
Authors: J.-P. Duval 
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90113-2
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)
Cites Work
Cited In (40)
- New results on Nyldon words and Nyldon-like sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing \(k\)-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
- Lyndon words formalized in Isabelle/HOL
- On the support of graph Lie algebras
- Lyndon partial words and arrays with applications
- Universal Lyndon words
- Inferring strings from Lyndon factorization
- Music and combinatorics on words: a historical survey
- Computation of maximal determinants of binary circulant matrices
- Nyldon words
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- A constructive approach to robust chaos using invariant manifolds and expanding cones
- Identities for Dirichlet and Lambert-type series arising from the numbers of a certain special word
- Binary quadratic forms as dessins
- Setup of order conditions for splitting methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- The BCH-formula and order conditions for splitting methods
- Lyndon morphisms
- Synchronization of musical words
- Generalized de Bruijn words for primitive words and powers
- Average cost of Duval's algorithm for generating Lyndon words
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- The coolest way to generate binary strings
- Limit Law of the Length of the Standard Right Factor of a Lyndon Word
- Lyndon Words, Free Algebras and Shuffles
- Linear construction of a left Lyndon tree
- THE SEMIGROUP OF CONJUGATES OF A WORD
- Lyndon trees
- Practical splitting methods for the adaptive integration of nonlinear evolution equations. I: Construction of optimized schemes and pairs of schemes
- 2D Lyndon words and applications
- Generating Lyndon brackets.
- Language of Lyndon partial words
- Macsyma computation of local minimal realization of dynamical systems of which generating power series are finite
- Cartesian and Lyndon trees
- The height of the Lyndon tree
- Title not available (Why is that?)
- Words over an ordered alphabet and suffix permutations
This page was built for publication: 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)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121024)
