Morphically primitive words

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.

[1]  G. Rota The Number of Partitions of a Set , 1964 .

[2]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[3]  Daniel Reidenbach,et al.  Discontinuities in pattern inference , 2008, Theor. Comput. Sci..

[4]  Dominik D. Freydenberger,et al.  The Unambiguity of Segmented Morphisms , 2007, Developments in Language Theory.

[5]  Gwénaël Richomme,et al.  On a conjecture about finite fixed points of morphisms , 2005, Theor. Comput. Sci..

[6]  Tao Jiang,et al.  Decision Problems for Patterns , 1995, J. Comput. Syst. Sci..

[7]  Andrzej Ehrenfeucht,et al.  Finding a Homomorphism Between Two Words is NP-Complete , 1979, Inf. Process. Lett..

[8]  Martin Fowler,et al.  Patterns , 2021, IEEE Software.

[9]  Tom Head,et al.  Fixed languages and the adult languages of ol schemest , 1981 .

[10]  Dominik D. Freydenberger,et al.  Unambiguous Morphic Images of Strings , 2005, Developments in Language Theory.

[11]  Daniel A. Reidenbach,et al.  Morphically Primitive Words (Extended Abstract) , 2007 .

[12]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..