The numbers of repeated palindromes in the Fibonacci and Tribonacci words
From MaRDI portal
Publication:2399293
DOI10.1016/j.dam.2017.06.012zbMath1380.68321OpenAlexW2736257996MaRDI QIDQ2399293
Publication date: 22 August 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.012
Related Items (3)
Derived sequences and the factor spectrum of the period-doubling sequence ⋮ Unnamed Item ⋮ Binet type formula for Tribonacci sequence with arbitrary initial numbers
Cites Work
- Unnamed Item
- Kernel words and gap sequence of the Tribonacci sequence
- The sequence of return words of the Fibonacci sequence
- The structure of subword graphs and suffix trees of Fibonacci words
- On stabilizers of infinite words
- The exact number of squares in Fibonacci words
- Palindromes in the Fibonacci word
- A characterization of substitutive sequences using return words
- A characterization of the squares in a Fibonacci string
- On cube-free \(\omega\)-words generated by binary morphisms
- Corrigendum to: ``The exact number of squares in Fibonacci words
- Some properties of the Tribonacci sequence
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- Mechanical Proofs of Properties of the Tribonacci Word
- Repetitions in the Fibonacci infinite word
- Automatic Sequences
- Some properties of the singular words of the Fibonacci word
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: The numbers of repeated palindromes in the Fibonacci and Tribonacci words
