Fibonacci word patterns in two-way infinte Fibonacci words
碩士 === 中原大學 === 應用數學研究所 === 94 === Let α=(√5-1)/2. Define G=…d-2d-1d0d1d2…, where dn=└ (n+1) α┘-└ nα┘; G'=…e-2e-1e0e1e2…, where en=┌(n+1) α┐-┌nα┐. G and G' are two-way infinite words, and are called two-way infinite Fibonacci binary words. For every nonnegative integer m, let Gm=dm+1dm+2dm...
Main Authors: | Fang-Yi Liao, 廖芳儀 |
---|---|
Other Authors: | Wai-Fong Chuan |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/31454505869701607492 |
Similar Items
-
On the k-Fibonacci words
by: Ramírez Jósé L., et al.
Published: (2013-12-01) -
Periodic words connected with the Fibonacci words
by: G.M. Barabash, et al.
Published: (2016-06-01) -
Rhythms of Arabic words and Fibonacci words
by: Imad-Eddine Benkoudad, et al.
Published: (2021-10-01) -
Matrices Involving Fibonacci Words
by: Cheng-Ho Shen, et al.
Published: (2003) -
Fibonacci words in hyperbolic Pascal triangles
by: Németh László
Published: (2017-12-01)