Nevisi_Reidenbach_WORDS_2011_Unambiguous_1_Uniform_Morphisms.pdf (121.22 kB)

Unambiguous 1 - uniform morphisms

Download (121.22 kB)
conference contribution
posted on 13.10.2011 by Hossein Nevisi, Daniel Reidenbach
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.

History

School

  • Science

Department

  • Computer Science

Citation

NEVISI, H. and REIDENBACH, D., 2011. Unambiguous 1 - uniform morphisms. IN: Proceedings 8th International Conference, Words 2011, Prague, Czech Republic, 12-16th September, pp. 158-167

Publisher

EPTCS/ © H. Nevisi, D. Reidenbach

Version

VoR (Version of Record)

Publication date

2011

Notes

This is a conference paper. Further details of the conference can be found at: http://arxiv.org/abs/1108.3412v1

Language

en

Exports

Logo branding

Keyword(s)

Exports