Unambiguous 1-uniform morphisms

@article{Nevisi2011Unambiguous1M,
  title={Unambiguous 1-uniform morphisms},
  author={Hossein Nevisi and Daniel A. Reidenbach},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={478},
  pages={101-117}
}
A morphism @s is unambiguous with respect to a word @a if there is no other morphism @t that maps @a to the same image as @s. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform morphism, i.e., a morphism that maps every letter in the word to an image of length 1. 

Unambiguous 1-Uniform Morphisms (cid:73)

A morphism σ is unambiguous with respect to a word α if there is no other morphism τ that maps α to the same image as σ . In the present paper we study the question of whether, for any given word,

Morphic Primitivity and Alphabet Reductions

The present paper investigates the effect of alphabet reductions on morphically primitive words, i.e., words that are not a fixed point of a nontrivial morphism and answers a question on the existence of unambiguous alphabet reductions for such words.

Institutional Repository Morphic primitivity and alphabet reductions

The present paper investigates the effect of alphabet reductions on morphically primitive words, i.

References

SHOWING 1-10 OF 18 REFERENCES

Weakly Unambiguous Morphisms

The main result is a compact characterisation that holds for all morphisms with ternary or larger target alphabets, and comprehensively describes those words that have a weakly unambiguous length-increasing morphism with a unary target alphabet.

Restricted ambiguity of erasing morphisms

On a conjecture about finite fixed points of morphisms

Unambiguous erasing morphisms in free monoids

The present paper demonstrates that, in contrast to the main result by Freydenberger et al., the existence of an unambiguous erasing morphisms for a given string can essentially depend on the size of the target alphabet of the morphism.

Unambiguous Morphic Images of Strings

The studies demonstrate that the existence of unambiguous morphic images essentially depends on the structure of α, and formulates the main result according to which a string α can be mapped by an injective morphism onto an unambiguous image if and only if α is succinct.

The Unambiguity of Segmented Morphisms

This work features the first approach to a characterisation of sets of strings with respect to which certain fixed morphisms are unambiguous, and it leads to fairly counter-intuitive insights into the relations between such sets.

Morphically primitive words

Equations in Words

Discontinuities in pattern inference