Name
Abstract | ||
|---|---|---|
In the present paper, we introduce an alternative notion of the primitivity of words, that-unlike the standard understanding of this term-is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet @S, we call a word w@?@S^*morphically imprimitive provided that there are a shorter word v and morphisms h,h^':@S^*-@S^* satisfying h(v)=w and h^'(w)=v, and we say that w is morphically primitive otherwise. We explain why this is a well-chosen terminology, we demonstrate that morphic (im-) primitivity of words is a vital attribute in many combinatorial domains based on finite words and morphisms, and we study a number of fundamental properties of the concepts under consideration. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.tcs.2009.01.020 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Combinatorics on words,fundamental property,standard understanding,Primitivity,shorter word v,satisfying h,Fixed points,morphisms h,Morphically primitive word,Morphisms,present paper,finite word,alternative notion,word w,morphically imprimitive | Journal | 410 |
Issue | ISSN | Citations |
21-23 | Theoretical Computer Science | 9 |
PageRank | References | Authors |
0.82 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Reidenbach | 1 | 154 | 18.06 |
| Johannes C. Schneider | 2 | 32 | 3.52 |