A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear partitioning algorithm for hybrid Lyndons using \(V\)-order |
scientific article; zbMATH DE number 6243784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear partitioning algorithm for hybrid Lyndons using \(V\)-order |
scientific article; zbMATH DE number 6243784 |
Statements
A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (English)
0 references
9 January 2014
0 references
alphabet
0 references
circ-UMFF
0 references
lexicographic order
0 references
total order
0 references
unique maximal factorization family (UMFF)
0 references
\(V\)-order
0 references
\(V\)-word
0 references
partitioning algorithm
0 references
concatenation
0 references
linear-time RAM algorithms
0 references
string comparison
0 references
hybrid Lyndon words
0 references
factorization algorithms
0 references
0 references
