Gray codes for Fibonacci \(q\)-decreasing words

DOI10.1016/j.tcs.2022.06.003OpenAlexW3092944837MaRDI QIDQ2163389

Jean-Luc Baril, Sergey Kirgizov, Vicentiu 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

zbMATH Keywords

exhaustive generationGray codes(generalized) Fibonacci wordsFibonacci cubes/graphspopularity/frequency

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions

Uses Software

• FXT
• hfloat
• OEIS

Cites Work

• Gray code orders for \(q\)-ary words avoiding a given factor
• The origins of combinatorics on words
• The so-called Fibonacci numbers in ancient and medieval India
• Restricted binary strings and generalized Fibonacci numbers
• Gray codes for \(A\)-free strings
• Fibonacci-run graphs. II: Degree sequences
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• On median nature and enumerative properties of Fibonacci-like cubes
• Minimal change list for Lucas strings and some graph theoretic consequences
• Fibonacci-run graphs. I: Basic properties
• Generalized Fibonacci Numbers and Associated Matrices
• Jewels of Stringology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item