Restricted Ambiguity of Erasing Morphisms
A morphism h is called ambiguous for a string s if there is another morphism that maps s to the same image as h; otherwise, it is called unambiguous. In this paper, we examine some fundamental problems on the ambiguity of erasing morphisms. We provide a detailed analysis of so-called ambiguity partitions, and our main result uses this concept to characterise those strings that have a morphism of strongly restricted ambiguity. Furthermore, we demonstrate that there are strings for which the set of unambiguous morphisms, depending on the size of the target alphabet of these morphisms, is empty, finite or infinite. Finally, we show that the problem of the existence of unambiguous erasing morphisms is equivalent to some basic decision problems for nonerasing multi-pattern languages.
Unable to display preview. Download preview PDF.
- 2.Harju, T., Karhumäki, J.: Morphisms. In: , ch. 7, pp. 439–510Google Scholar
- 8.Mateescu, A., Salomaa, A.: Patterns. In: , ch. 4.6, pp. 230–242Google Scholar
- 9.Reidenbach, D.: The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages. Logos Verlag, Berlin (2006)Google Scholar