The sequence of return words of the Fibonacci sequence
From MaRDI portal
Publication:501001
DOI10.1016/j.tcs.2015.05.048zbMath1330.68236arXiv1404.4269OpenAlexW256990458MaRDI QIDQ501001
Publication date: 8 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.4269
Related Items
Some properties of the Fibonacci sequence on an infinite alphabet, Derived sequences and the factor spectrum of the period-doubling sequence, The numbers of repeated palindromes in the Fibonacci and Tribonacci words, Kernel words and factorization of the \(k\)-bonacci sequence, The network structure of Sturmian sequences based on HVG, The sum of digits functions of the Zeckendorf and the base phi expansions, On the conjugacy class of the Fibonacci dynamical system, Generalized Beatty sequences and complementary triples
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lyndon words and Fibonacci numbers
- Locating factors of the infinite Fibonacci word
- Occurrences of palindromes in characteristic Sturmian words
- Factors of characteristic words: location and decompositions
- Sequences with constant number of return words
- A combinatorial property of the Fibonacci words
- Lyndon words and singular factors of sturmian words
- A characterization of substitutive sequences using return words
- Some properties of the factors of Sturmian sequences.
- Some properties of the Tribonacci sequence
- Smooth words over arbitrary alphabets
- Hankel determinants for the Fibonacci word and Padé approximation
- Automatic Sequences
- Some properties of the singular words of the Fibonacci word
- A characterization of Sturmian words by return words
