PT Unknown
AU Fleischmann, P
TI On Special k-Spectra, k-Locality, and Collapsing Prefix Normal Words
SE Kiel Computer Science Series
PY 2011
VL 2021/3
PU Department of Computer Science
DI 10.21941/kcss/2021/3
WP https://macau.uni-kiel.de/receive/macau_mods_00002277
LA en
DE combinatorics on words; scattered factor; reconstruction problem; k-universality; k-locality; prefix normal words; collapsing prefix normal words
SN 2194-6639
AB How to reconstruct a word from a given set ofscattered factors? How to determine thelocalityof a word? Or how to determine theprefix normal words recursively? Combinatorics on words, even though this domain is relatively young, has by now a lot of subdomains, which all seek to deter-mine the secrets of various words that share a common pattern. Aiming for an understanding of this pattern or even find such apattern is often a challenging task. In Part I, scattered factors are investigated with respect to therecon-struction problemand thescattered factor universality. In Part II, thek-locality of repetitions of words and palindromes is determined. Finally, in Part III, a recursive approach to determine prefix normalforms is given.
PI Kiel
ER