Greedy Gray Codes for some Restricted Classes of Binary Words
Nathana\"el Hassler, Vincent Vajnovszki, Dennis Wong
TL;DR
This paper explores the construction of greedy Gray codes for specific classes of binary words, namely generalized Fibonacci and Dyck words, focusing on how the initial element influences code existence.
Contribution
It introduces new methods for generating greedy Gray codes tailored to generalized Fibonacci and Dyck words, expanding understanding of Gray code applicability.
Findings
Existence conditions for greedy Gray codes in these classes
New algorithms for code construction based on initial element choice
Insights into the structure of binary words for Gray code generation
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.