Unambiguous 1-Uniform Morphisms
Formal Languages and Automata Theory
2011-08-19 v1 Discrete Mathematics
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.
Cite
@article{arxiv.1108.3633,
title = {Unambiguous 1-Uniform Morphisms},
author = {Hossein Nevisi and Daniel Reidenbach},
journal= {arXiv preprint arXiv:1108.3633},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412