Unambiguous 1-uniform morphisms

作者:Nevisi Hossein*; Reidenbach Daniel
来源:Theoretical Computer Science, 2013, 478: 101-117.
DOI:10.1016/j.tcs.2012.11.023

摘要

A morphism a is unambiguous with respect to a word a if there is no other morphism tau that maps a to the same image as a. 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.

  • 出版日期2013-3-25

全文