On the Complexity of the Generalized Fibonacci Words
From MaRDI portal
Publication:5088662
DOI10.1051/ita/2022007OpenAlexW4293200911MaRDI QIDQ5088662
Idrissa Kaboré, Julien Cassaigne
Publication date: 13 July 2022
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2022007
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial property of the Fibonacci words
- Subword complexities of various classes of deterministic developmental languages without interactions
- Complexity and special factors
- On extremal properties of the Fibonacci word
- Repetitions in the Fibonacci infinite word
- Automatic Sequences