On the Complexity of the Generalized Fibonacci Words
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1111405
- On the k-Fibonacci words
- On extremal properties of the Fibonacci word
- Automatic complexity of Fibonacci and tribonacci words
- Arithmetics on suffix arrays of Fibonacci words
- Generalised Fibonacci sequences constructed from balanced words
- Some extremal properties of the Fibonacci word
- scientific article; zbMATH DE number 4183705
- Combinatorial properties of Fibonacci partial words and arrays
- On Beatty's theorem, Wythoff's sequences and Fibonacci words
Cites work
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A combinatorial property of the Fibonacci words
- Automatic Sequences
- Complexity and special factors
- From the Fibonacci word to Sturmian words
- On extremal properties of the Fibonacci word
- Repetitions in the Fibonacci infinite word
- Subword complexities of various classes of deterministic developmental languages without interactions
Cited in
(4)
This page was built for publication: On the Complexity of the Generalized Fibonacci Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088662)