首页    期刊浏览 2024年09月18日 星期三
登录注册

文章基本信息

  • 标题:Weakly Unambiguous Morphisms
  • 本地全文:下载
  • 作者:Dominik D. Freydenberger ; Hossein Nevisi ; Daniel Reidenbach
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2011
  • 卷号:9
  • 页码:213-224
  • DOI:10.4230/LIPIcs.STACS.2011.213
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:Combinatorics on words; Morphisms; Ambiguity
国家哲学社会科学文献中心版权所有