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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31454505869701607492 |