7 research outputs found
Unambiguous 1-Uniform Morphisms
A morphism h is unambiguous with respect to a word w if there is no other
morphism g that maps w to the same image as h. 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.Comment: In Proceedings WORDS 2011, arXiv:1108.341
Unambiguous 1-uniform morphisms
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, there exists an unambiguous 1-uniform morphism, i.e., a morphism that maps every letter in the word to an image of length 1
Conditions on the existence of unambiguous morphisms
A morphism α is (strongly) unambiguous with respect to a word α if there is no
other morphism τ that maps α to the same image as σ. Moreover, α is said to be
weakly unambiguous with respect to a word α if σ is the only nonerasing morphism.....
Morphic primitivity and alphabet reductions
An alphabet reduction is a 1-uniform morphism that maps
a word to an image that contains a smaller number of dfferent letters.
In the present paper we investigate the effect of alphabet reductions on
morphically primitive words, i. e., words that are not a fixed point of
a nontrivial morphism. Our first main result answers a question on the
existence of unambiguous alphabet reductions for such words, and our
second main result establishes whether alphabet reductions can be given
that preserve morphic primitivity. In addition to this, we study Billaud's
Conjecture - which features a dfferent type of alphabet reduction, but
is otherwise closely related to the main subject of our paper - and prove
its correctness for a special case
Morphic Primitivity and Alphabet Reductions
An alphabet reduction is a 1-uniform morphism that maps
a word to an image that contains a smaller number of dfferent letters.
In the present paper we investigate the effect of alphabet reductions on
morphically primitive words, i. e., words that are not a fixed point of
a nontrivial morphism. Our first main result answers a question on the
existence of unambiguous alphabet reductions for such words, and our
second main result establishes whether alphabet reductions can be given
that preserve morphic primitivity. In addition to this, we study Billaud's
Conjecture - which features a dfferent type of alphabet reduction, but
is otherwise closely related to the main subject of our paper - and prove
its correctness for a special case
On restricting the ambiguity in morphic images of words
For alphabets Delta_1, Delta_2, a morphism g : Delta_1* to Delta_2* is ambiguous with respect to a word u in Delta_1* if there exists a second morphism h : Delta_1* to Delta_2* such that g(u) = h(u) and g not= h. Otherwise g is unambiguous. Hence unambiguous morphisms are those whose structure is fully preserved in their morphic images.
A concept so far considered in the free monoid, the first part of this thesis considers natural extensions of ambiguity of morphisms to free groups. It is shown that, while the most straightforward generalization of ambiguity to a free monoid results in a trivial situation, that all morphisms are (always) ambiguous, there exist meaningful extensions of (un)ambiguity which are non-trivial - most notably the concepts of (un)ambiguity up to inner automorphism and up to automorphism.
A characterization is given of words in a free group for which there exists an injective morphism which is unambiguous up to inner automorphism in terms of fixed points of morphisms, replicating an existing result for words in the free monoid. A conjecture is presented, which if correct, is sufficient to show an equivalent characterization for unambiguity up to automorphism. A rather counterintuitive statement is also established, that for some words, the only unambiguous (up to automorphism) morphisms are non-injective (or even periodic).
The second part of the thesis addresses words for which all non-periodic morphisms are unambiguous. In the free monoid, these take the form of periodicity forcing words. It is shown using morphisms that there exist ratio-primitive periodicity forcing words over arbitrary alphabets, and furthermore that it is possible to establish large and varied classes in this way. It is observed that the set of periodicity forcing words is spanned by chains of words, where each word is a morphic image of its predecessor. It is shown that the chains terminate in exactly one direction, meaning not all periodicity forcing words may be reached as the (non-trivial) morphic image of another. Such words are called prime periodicity forcing words, and some alternative methods for finding them are given.
The free-group equivalent to periodicity forcing words - a special class of C-test words - is also considered, as well as the ambiguity of terminal-preserving morphisms with respect to words containing terminal symbols, or constants. Moreover, some applications to pattern languages and group pattern languages are discussed
Unambiguous 1-uniform morphisms
NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published at: http://dx.doi.org/10.1016/j.tcs.2012.11.023A 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, there exists an unambiguous 1-uniform morphism, i.e., a morphism that maps every letter in the word to an image of length 1