Some properties of the Fibonacci sequence on an infinite alphabet
From MaRDI portal
Publication:2363115
zbMATH Open1366.11038MaRDI QIDQ2363115FDOQ2363115
Authors: Jiemeng Zhang, Wen Wu, Zhixiong 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- Automatic Sequences
- Nombres algébriques et substitutions
- Some properties of the Tribonacci sequence
- Substitutions in dynamics, arithmetics and combinatorics
- Lyndon words and singular factors of sturmian words
- Lyndon factorization of Sturmian words
- A combinatorial property of the Fibonacci words
- Lyndon words and Fibonacci numbers
- Some properties of the singular words of the Fibonacci word
- Some properties of the factors of Sturmian sequences.
- Title not available (Why is that?)
- Hankel determinants for the Fibonacci word and Padé approximation
- Locating factors of the infinite Fibonacci word
- Occurrences of palindromes in characteristic Sturmian words
- Smooth words over arbitrary alphabets
- Balances of m-bonacci Words
- Substitution dynamical systems on infinite alphabets
- Padé approximation for words generated by certain substitutions, and Hankel determinants
- The sequence of return words of the Fibonacci sequence
- Conjugation of standard morphisms and a generalization of singular words
- Title not available (Why is that?)
- An Infinite Automaton Characterization of Double Exponential Time
- Morphisms on infinite alphabets, countable states automata and regular sequences
- On the \(k\)-Fibonacci words
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake
Cited In (10)
- Title not available (Why is that?)
- A skeleton model to enumerate standard puzzle sequences
- Title not available (Why is that?)
- On square factors and critical factors of \(k\)-bonacci words on infinite alphabet
- Morphic words, Beatty sequences and integer images of the Fibonacci language
- Fibonacci words, hyperbolic tilings and grossone
- Fibonacci-type \(1D\) and \(2D\) words
- A formula for an infinite family of Fibonacci-word sequences
- Infinite word factorization and signal flow graph
- More properties of the Fibonacci word on an infinite alphabet
Uses Software
This page was built for publication: Some properties of the Fibonacci sequence on an infinite alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363115)
