...
首页> 外文期刊>Theoretical computer science >Fibonacci word patterns in two-way infinite Fibonacci words
【24h】

Fibonacci word patterns in two-way infinite Fibonacci words

机译:双向无限斐波那契单词中的斐波那契单词模式

获取原文
获取原文并翻译 | 示例
           

摘要

The studies of 1-Fibonacci word patterns and 0-Fibonacci word patterns were initiated by Turner (1988) [18] and Chuan (1993) [2] respectively. It is known that each proper suffix of the infinite Fibonacci word is an r-Fibonacci word pattern, r ∈ {0, 1}. In this paper, we consider the suffixes of the two two-way infinite extensions G and G' of the infinite Fibonacci word. We obtain necessary and sufficient conditions for suffixes of G and G' to be r-Fibonacci word patterns. This gives us all the mechanical words with slope α = {the square root of}5-1/2 which are r-Fibonacci word patterns. All possible r-seed words of each of them are determined. Finally, images of suffixes of G and G' under the action of certain Sturmian morphisms are computed.
机译:1-Fibonacci字型和0-Fibonacci字型的研究分别由Turner(1988)[18]和Chuan(1993)[2]发起。众所周知,无限斐波那契词的每个适当后缀都是r-斐波那契词模式,r∈{0,1}。在本文中,我们考虑了无限斐波那契单词的两个双向无限扩展G和G'的后缀。我们为G和G'的后缀成为r-Fibonacci单词模式获得了必要和充分的条件。这为我们提供了斜率α= {5-1 / 2的平方根}的所有机械单词,它们都是r-Fibonacci单词模式。确定每个单词的所有可能的r种子字。最后,计算了在某些Sturmian态射影作用下的G和G'后缀的图像。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号