Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T09:57:40.274Z Has data issue: false hasContentIssue false

Root clustering of words∗

Published online by Cambridge University Press:  23 May 2014

Gerhard Lischke*
Affiliation:
Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 1-4, 07743 Jena, Germany.. gerhard.lischke@uni-jena.de

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Six kinds of both of primitivity and periodicity of words, introduced by Ito and Lischke[M. Ito and G. Lischke, Math. Log. Quart. 53 (2007) 91–106;Corrigendum in Math. Log. Quart. 53 (2007) 642–643], giverise to defining six kinds of roots of a nonempty word. For 1 ≤ k ≤ 6, ak-root wordis a word which has exactly k different roots, and a k-cluster is a set ofk-rootwords u wherethe roots of u fulfil a given prefix relationship. We show thatout of the 89 different clusters that can be considered at all, in fact only 30 exist, andwe give their quasi-lexicographically smallest elements. Also we give a sufficientcondition for words to belong to the only existing 6-cluster. These words are also calledLohmann words. Further we show that, with the exception of a single cluster, each of theexisting clusters contains either only periodic words, or only primitive words.