Greedy Gray Codes for some Restricted Classes of Binary Words

June 24, 2024 · The Ethereal · 🏛 International Conference on Random and Exhaustive Generation of Combinatorial Structures

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong arXiv ID 2406.16405 Category cs.DM: Discrete Mathematics Cross-listed cs.DS, math.CO Citations 2 Venue International Conference on Random and Exhaustive Generation of Combinatorial Structures Last Checked 2 months ago
Abstract
We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalized Dyck words.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics