Decision problems for patterns
Journal of Computer and System Sciences
Handbook of Formal Languages
On a conjecture about finite fixed points of morphisms
Theoretical Computer Science - Combinatorics on words
Discontinuities in pattern inference
Theoretical Computer Science
The unambiguity of segmented morphisms
DLT'07 Proceedings of the 11th international conference on Developments in language theory
The unambiguity of segmented morphisms
Discrete Applied Mathematics
Existence and nonexistence of descriptive patterns
Theoretical Computer Science
Restricted ambiguity of erasing morphisms
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Restricted ambiguity of erasing morphisms
Theoretical Computer Science
Theoretical Computer Science
Morphic primitivity and alphabet reductions
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Unambiguous 1-uniform morphisms
Theoretical Computer Science
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
| Hi-index | 5.23 |
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.