Generating cyclic 2-Gray codes for Fibonacci \(q\)-decreasing words
From MaRDI portal
Publication:6575386
DOI10.1007/978-981-97-0566-5_8MaRDI QIDQ6575386
Dennis Pak Shing Wong, Marcus Im, Bowie Liu, Chan-Tong Lam
Publication date: 19 July 2024
hypercubeFibonacci sequenceGray codeFibonacci cubeFibonacci word\(q\)-decreasing wordQubonacci wordrun-constrained word
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fibonacci-run graphs. II: Degree sequences
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Gray codes for Fibonacci \(q\)-decreasing words
- Fibonacci-run graphs. I: Basic properties
- Flip-swap languages in binary reflected Gray code order
- Generalized Fibonacci Numbers and Associated Matrices
- A Survey of Combinatorial Gray Codes
- Asymptotic bit frequency in Fibonacci words
- Fibonacci Cubes with Applications and Variations
This page was built for publication: Generating cyclic 2-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 Q6575386)
