Weakly Unambiguous Morphisms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Weakly Unambiguous Morphisms

Résumé

A nonerasing morphism $\sigma$ is said to be weakly unambiguous with respect to a word $w$ if $\sigma$ is the only nonerasing morphism that can map $w$ to $\sigma(w)$, i.\,e., there does not exist any other nonerasing morphism $\tau$ satisfying $\tau(w) = \sigma(w)$. In the present paper, we wish to characterise those words with respect to which there exists such a morphism. This question is nontrivial if we consider so-called length-increasing morphisms, which map a word to an image that is strictly longer than the word. Our main result is a compact characterisation that holds for all morphisms with ternary or larger target alphabets. We also comprehensively describe those words that have a weakly unambiguous length-increasing morphism with a unary target alphabet, but we have to leave the problem open for binary alphabets, where we can merely give some non-characteristic conditions.
Fichier principal
Vignette du fichier
23.pdf (274.13 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00573632 , version 1 (05-03-2011)

Identifiants

  • HAL Id : hal-00573632 , version 1

Citer

Dominik Freydenberger, Hossein Nevisi, Daniel Reidenbach. Weakly Unambiguous Morphisms. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.225-236. ⟨hal-00573632⟩

Collections

STACS2011
51 Consultations
87 Téléchargements

Partager

Gmail Facebook X LinkedIn More