Unambiguous 1-uniform morphisms

DOI10.4204/EPTCS.63.22MaRDI QIDQ2789526zbMATH OpenFDO

Authors Hossein Nevisi, Daniel Reidenbach

Publication date 1 March 2016

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.3633, http://www.emis.de/proceedings/Words2011/paper-19.html?WORDS2011.22

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: 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.

Recommendations

• Unambiguous 1-uniform morphisms
• Weakly unambiguous morphisms
• Weakly unambiguous morphisms
• The Unambiguity of Segmented Morphisms
• Ambiguity of morphisms in a free group

Cited in

(7)

• Unambiguous 1-uniform morphisms
• Unambiguous injective morphisms in free groups
• Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants
• Weakly unambiguous morphisms
• Weakly unambiguous morphisms
• The Unambiguity of Segmented Morphisms
• The unambiguity of segmented morphisms

This page was built for publication: Unambiguous 1-uniform morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789526)