Suffixes of Fibonacci word patterns
From MaRDI portal
Elements of the theory of formal languages and of grammars are used for studying properties of the Fibonacci sequence. The paper is a continuation of the authors' and \textit{J. Turner}'s previous papers [Zbl 0692.05009; Zbl 0671.10007; Zbl 0758.68052; Zbl 0804.11013; Zbl 0842.11007; Zbl 0862.11015; Zbl 0890.68108].
Recommendations
Cited in
(7)- Properties of Fibonacci languages
- The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words
- scientific article; zbMATH DE number 4132165 (Why is no real title available?)
- Markov word patterns and a relation on -words
- Arithmetics on suffix arrays of Fibonacci words
- Fibonacci word patterns in two-way infinite Fibonacci words
- scientific article; zbMATH DE number 2124023 (Why is no real title available?)
This page was built for publication: Suffixes of Fibonacci word patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707842)