Some properties of the Fibonacci sequence on an infinite alphabet
From MaRDI portal
Publication:2363115
zbMath1366.11038MaRDI QIDQ2363115
Wen Wu, Jie-Meng Zhang, Zhi Xiong Wen
Publication date: 13 July 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p52
Related Items (3)
A skeleton model to enumerate standard puzzle sequences ⋮ On square factors and critical factors of \(k\)-bonacci words on infinite alphabet ⋮ More properties of the Fibonacci word on an infinite alphabet
Uses Software
Cites Work
- Lyndon words and Fibonacci numbers
- The sequence of return words of the Fibonacci sequence
- Substitutions in dynamics, arithmetics and combinatorics
- Locating factors of the infinite Fibonacci word
- Occurrences of palindromes in characteristic Sturmian words
- A combinatorial property of the Fibonacci words
- Lyndon words and singular factors of sturmian words
- Some properties of the factors of Sturmian sequences.
- Morphisms on infinite alphabets, countable states automata and regular sequences
- Conjugation of standard morphisms and a generalization of singular words
- Lyndon factorization of Sturmian words
- Some properties of the Tribonacci sequence
- Substitution dynamical systems on infinite alphabets
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake
- Smooth words over arbitrary alphabets
- Balances of m-bonacci Words
- An Infinite Automaton Characterization of Double Exponential Time
- Nombres algébriques et substitutions
- Hankel determinants for the Fibonacci word and Padé approximation
- Automatic Sequences
- Some properties of the singular words of the Fibonacci word
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some properties of the Fibonacci sequence on an infinite alphabet
