Gray codes for Fibonacci q-decreasing words
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1665457 (Why is no real title available?)
- scientific article; zbMATH DE number 1354135 (Why is no real title available?)
- scientific article; zbMATH DE number 553907 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 5279410 (Why is no real title available?)
- Analytic combinatorics
- Fibonacci-run graphs. I: Basic properties
- Fibonacci-run graphs. II: Degree sequences
- Generalized Fibonacci Numbers and Associated Matrices
- Gray code orders for \(q\)-ary words avoiding a given factor
- Gray codes for \(A\)-free strings
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Jewels of Stringology
- Minimal change list for Lucas strings and some graph theoretic consequences
- On median nature and enumerative properties of Fibonacci-like cubes
- Restricted binary strings and generalized Fibonacci numbers
- The Fibonacci hypercube
- The origins of combinatorics on words
- The so-called Fibonacci numbers in ancient and medieval India
Cited in
(3)
This page was built for publication: Gray codes for Fibonacci \(q\)-decreasing words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163389)