The following pages link to On generalized Lyndon words (Q2422029):
Displaying 20 items.
- Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions (Q819177) (← links)
- New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
- Lyndon words formalized in Isabelle/HOL (Q832940) (← links)
- Chen-Fox-Lyndon factorization for words over partially ordered sets (Q1040241) (← links)
- Lyndon words and singular factors of sturmian words (Q1292480) (← links)
- Lyndon morphisms (Q1781929) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Reprint of: ``\(\omega\)-Lyndon words'' (Q2192372) (← links)
- Reprint of: ``Generalized Lyndon factorizations of infinite words'' (Q2192374) (← links)
- \( \omega \)-Lyndon words (Q2290620) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Nyldon words (Q2318478) (← links)
- Generalized Lyndon words (Q2654566) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- Computation of k-ary Lyndon words using generating functions and their differential equations (Q5029977) (← links)
- (Q5088889) (← links)
- Generalized Lyndon factorizations of infinite words (Q5919346) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
- \(V\)-words, Lyndon words and substring circ-UMFFs (Q6606210) (← links)
