000K utf8 1100 $c2021 1500 eng 2050 urn:nbn:de:gbv:8:1-zs-00000372-a9 2051 10.21941/kcss/2021/3 3000 Fleischmann, Pamela 4000 On Special k-Spectra, k-Locality, and Collapsing Prefix Normal Words$hChristian-Albrechts-Universität zu Kiel [Fleischmann, Pamela] 4030 Kiel$nChristian-Albrechts-Universität zu Kiel 4209 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. 4950 https://doi.org/10.21941/kcss/2021/3$xR$3Volltext$534 4950 https://nbn-resolving.org/urn:nbn:de:gbv:8:1-zs-00000372-a9$xR$3Volltext$534 4961 https://macau.uni-kiel.de/receive/macau_mods_00002277 5051 004 5550 collapsing prefix normal words 5550 combinatorics on words 5550 k-locality 5550 k-universality 5550 prefix normal words 5550 reconstruction problem 5550 scattered factor