Gray codes for Fibonacci q-decreasing words
From MaRDI portal
Publication:2163389
DOI10.1016/J.TCS.2022.06.003OpenAlexW3092944837MaRDI QIDQ2163389FDOQ2163389
Authors: Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Publication date: 10 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.09505
Recommendations
exhaustive generationGray codes(generalized) Fibonacci wordsFibonacci cubes/graphspopularity/frequency
Cites Work
- Title not available (Why is that?)
- Analytic combinatorics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Jewels of Stringology
- Title not available (Why is that?)
- Generalized Fibonacci Numbers and Associated Matrices
- Title not available (Why is that?)
- The origins of combinatorics on words
- On median nature and enumerative properties of Fibonacci-like cubes
- The so-called Fibonacci numbers in ancient and medieval India
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gray codes for \(A\)-free strings
- Gray code orders for \(q\)-ary words avoiding a given factor
- Minimal change list for Lucas strings and some graph theoretic consequences
- Restricted binary strings and generalized Fibonacci numbers
- The Fibonacci hypercube
- Fibonacci-run graphs. II: Degree sequences
- Fibonacci-run graphs. I: Basic properties
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
Cited In (3)
Uses Software
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)