Combinatorics of unique maximal factorization families (UMFFs)

Combinatorics of unique maximal factorization families (UMFFs)

Suppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ+ has a unique maximal factorization over W. The classic circ-UMFF is the set of Lyndon words based on lexicographic ordering (195...

Full description

Bibliographic Details
Main Authors: Daykin, D., Daykin, J., Smyth, Bill
Format: Journal Article
Published: IOS Press 2009
Subjects:
UMFF
dictionary
factor
concatenate
total order
circ-UMFF
Lyndon
maximal
string
word
alphabet
lexicographic order
Online Access:http://hdl.handle.net/20.500.11937/19951

Internet

http://hdl.handle.net/20.500.11937/19951

Similar Items