@PhdThesis{macau_mods_00002277, author = {Fleischmann, Pamela}, editor = {von Hanxleden, Reinhard and Domr{\"o}s, S{\"o}ren}, title = {On Special k-Spectra, k-Locality, and Collapsing Prefix Normal Words}, series = {Kiel Computer Science Series}, year = {2011}, publisher = {Department of Computer Science}, address = {Kiel}, volume = {2021/3}, keywords = {combinatorics on words; scattered factor; reconstruction problem; k-universality; k-locality; prefix normal words; collapsing prefix normal words}, abstract = {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.}, issn = {2194-6639}, doi = {10.21941/kcss/2021/3}, url = {https://macau.uni-kiel.de/receive/macau_mods_00002277}, url = {https://doi.org/10.21941/kcss/2021/3}, file = {:https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00003376/kcss_2021_03.pdf:PDF}, language = {en} }