A simple representation of subwords of the Fibonacci word
From MaRDI portal
(Redirected from Publication:1675765)
Recommendations
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A representation theorem of the suffixes of characteristic sequences
- Compressed string-matching in standard Sturmian words
- Locating factors of the infinite Fibonacci word
- The structure of subword graphs and suffix trees of Fibonacci words
Cited in
(10)- A class of generalized Tribonacci sequences applied to counting problems
- The structure of subword graphs and suffix trees of Fibonacci words
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- scientific article; zbMATH DE number 410199 (Why is no real title available?)
- scientific article; zbMATH DE number 895316 (Why is no real title available?)
- SOFSEM 2006: Theory and Practice of Computer Science
- Combinatorial properties of Fibonacci partial words and arrays
- Arithmetics on suffix arrays of Fibonacci words
- Implementation and Application of Automata
- The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words
This page was built for publication: A simple representation of subwords of the Fibonacci word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675765)
