Unambiguous 1 - uniform morphisms

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

Full description

Saved in:
Bibliographic Details
Main Authors: Hossein Nevisi, Daniel Reidenbach
Format: Default Conference proceeding
Published: 2011
Subjects:
Other information and computing sciences not elsewhere classified
untagged
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/8939
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/8939

Similar Items