Fibonacci word patterns in two-way infinite Fibonacci words
From MaRDI portal
Publication:441849
DOI10.1016/j.tcs.2012.02.020zbMath1245.68150OpenAlexW1974223983MaRDI QIDQ441849
Hui-Ling Ho, Wai-Fong Chuan, Fang-Yi Liao, Fei Yu
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.020
seed word\(r\)-Fibonacci word patternlabel of Fibonacci wordmechanical wordSturmian morphismtwo-way infinite Fibonacci word
Combinatorics on words (68R15) Special sequences and polynomials (11B83) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (2)
Markov word patterns and a relation on \(\alpha\)-words ⋮ The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words
Cites Work
- Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
- \(\alpha\)-words and the radix order
- A division property of the Fibonacci word
- Locating factors of the infinite Fibonacci word
- Factors of characteristic words: location and decompositions
- \(\alpha\)-words and factors of characteristic sequences
- A representation theorem of the suffixes of characteristic sequences
- Some properties of the factors of Sturmian sequences.
- Infinite words with linear subword complexity
- Sturmian morphisms and \(\alpha\)-words
- Some properties of the singular words of the Fibonacci word
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fibonacci word patterns in two-way infinite Fibonacci words